{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:45:14Z","timestamp":1773438314167,"version":"3.50.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Educ."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Computer Science (CS) Unplugged activities are designed to engage students with CS concepts. It is an active learning approach combining physical interaction with visual representation. This research article investigates the impact of CS Unplugged on students\u2019 understanding of the bubble sort algorithm. Algorithm visualization, traditionally employed for active knowledge construction, serves as the foundation for this approach. The research was conducted as a quasi-experiment in middle and high schools in Split, Croatia, among 204 students. We divided the participants into two groups: experimental (CS Unplugged) and control (traditional teaching). The study included pre-test, mid-test, and post-test assessments. While CS Unplugged did not significantly affect students\u2019 understanding of bubble sort, it positively influenced long-term retention of the algorithm. These results highlight the potential of CS Unplugged activities as an effective teaching approach for CS concepts, specifically in promoting long-term retention of the bubble sort algorithm. The study also revealed misconceptions that included restarting comparisons after each swap, assuming the largest element reaches the end after one swap, and repeatedly swapping the largest element with its neighbor. Addressing these misconceptions through active learning activities like CS Unplugged can contribute to deeper understanding beyond memorization.<\/jats:p>","DOI":"10.1145\/3706120","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T15:34:38Z","timestamp":1732808078000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Teaching the Bubble Sort Algorithm Using CS Unplugged Activities at the K-12 Level"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5330-605X","authenticated-orcid":false,"given":"Monika","family":"Mladenovi\u0107","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Split, Split, Croatia"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6336-8488","authenticated-orcid":false,"given":"Lucija","family":"Medak","sequence":"additional","affiliation":[{"name":"X.gimnazija \u201cIvan Supek,\u201d Zagreb, Croatia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5464-0711","authenticated-orcid":false,"given":"Divna","family":"Krpan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Split, Split, Croatia"}]}],"member":"320","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"e_1_3_1_2_1","volume-title":"Visualization Tools in Introductory Programming Education","author":"Aasen Finn Eivind","year":"2022","unstructured":"Finn Eivind Aasen. 2022. Visualization Tools in Introductory Programming Education. Master Thesis. Department of Informatics Faculty of Mathematics and Natural Sciences, University of Oslo, Oslo."},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/792548.611918"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98355-4_29"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICADIWT.2009.5273943"},{"issue":"2","key":"e_1_3_1_6_1","first-page":"1","article-title":"The methods and goals of teaching sorting algorithms in public education","volume":"7","author":"Bern\u00e1t P\u00e9ter","year":"2014","unstructured":"P\u00e9ter Bern\u00e1t. 2014. The methods and goals of teaching sorting algorithms in public education. Acta Didact. Napoc. 7, 2 (2014), 1\u20139.","journal-title":"Acta Didact. Napoc."},{"key":"e_1_3_1_7_1","volume-title":"Taxonomy of Educational Objectives: Handbook I: Cognitive Domain","author":"Bloom Benjamin S.","year":"1956","unstructured":"Benjamin S. Bloom, Max D. Engelhart, Edward J. Furst, Walker H. Hill, and David R. Krathwohl. 1956. Taxonomy of Educational Objectives: Handbook I: Cognitive Domain. Longmans, Green & Co."},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148493.1148496"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.17226\/9853"},{"key":"e_1_3_1_10_1","volume-title":"Toward a Theory of Instruction","author":"Bruner Jerome Seymour","year":"1966","unstructured":"Jerome Seymour Bruner. 1966. Toward a Theory of Instruction. Harvard University Press, London."},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/08993408.2016.1160664"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.4324\/9780203720967"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105726.3106190"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536628"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compedu.2020.103832"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999747.1999817"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/774833.774846"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287324.3287468"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3137065.3137072"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.2002.0237"},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/331795.331889"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1822090.1822140"},{"key":"e_1_3_1_23_1","volume-title":"Visual Algorithm Simulation","author":"Korhonen Ari","year":"2003","unstructured":"Ari Korhonen. 2003. Visual Algorithm Simulation. Helsinki University of Technology."},{"issue":"1","key":"e_1_3_1_24_1","first-page":"110","article-title":"Computer Science unplugged: K-12 special session","volume":"25","author":"Lehman Jeff","year":"2009","unstructured":"Jeff Lehman. 2009. Computer Science unplugged: K-12 special session. J. Comput. Sci. Coll. 25, 1 (October 2009), 110.","journal-title":"J. Comput. Sci. Coll."},{"issue":"6","key":"e_1_3_1_25_1","first-page":"62","article-title":"K-6 outreach using \u201cComputer Science Unplugged.\u201d","volume":"24","author":"Lucas Joan M.","year":"2009","unstructured":"Joan M. Lucas. 2009. K-6 outreach using \u201cComputer Science Unplugged.\u201d J. Comput. Sci. Coll. 24, 6 (June 2009), 62\u201363.","journal-title":"J. Comput. Sci. Coll."},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11412-006-9005-x"},{"key":"e_1_3_1_27_1","author":"Ministry of Science and Education of the Republic of Croatia","year":"2018","unstructured":"Ministry of Science and Education of the Republic of Croatia. 2018. The Informatics Curriculum for Middle and High Schools. Zagreb.","journal-title":"The Informatics Curriculum for Middle and High Schools"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/cae.22315"},{"key":"e_1_3_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287324.3287497"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513593.1513600"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1269900.1268857"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/960492.960540"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/960568.782998"},{"issue":"61","key":"e_1_3_1_34_1","first-page":"2","article-title":"Cognitive engineering","volume":"31","author":"Norman Donald A.","year":"1986","unstructured":"Donald A. Norman. 1986. Cognitive engineering. User Centered Syst. Des. 31, 61 (1986), 2.","journal-title":"User Centered Syst. Des"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1037\/11494-000"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1076\/csed.13.2.137.14200"},{"key":"e_1_3_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2490822"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3137065.3137081"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372143"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/jcal.12545"},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160547.2160551"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157136.2157281"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047344.1047390"},{"key":"e_1_3_1_44_1","unstructured":"Bubble Sort Algorithm (in Croatian). 2022. Split. Retrieved from https:\/\/www.youtube.com\/watch?v=nCI9x2gFmu0"}],"container-title":["ACM Transactions on Computing Education"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3706120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:03Z","timestamp":1750295883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,24]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3706120"],"URL":"https:\/\/doi.org\/10.1145\/3706120","relation":{},"ISSN":["1946-6226"],"issn-type":[{"value":"1946-6226","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,24]]},"assertion":[{"value":"2023-06-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}