Teaching Algorithm Design: A Literature Review
Open Access
- 20 May 2025
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 25 (2) , 1-20
Abstract
Algorithm design is a vital skill developed in most undergraduate Computer Science (CS) programs, but few research studies focus on pedagogy related to algorithms coursework. To understand the work that has been done in the area, we present a systematic survey and literature review of CS Education studies. We search for research that is both related to algorithm design (as described by the ACM Curricular Guidelines) and evaluated on post-secondary-level students. Across all venues we searched prior to July 2024, we only find 102 such papers. We first classify these papers by topic, evaluation metric, evaluation methods, and intervention target. Through our classification, we find a broad sparsity of papers which indicates that many open questions remain about teaching algorithm design. We also note the need for papers using rigorous research methods, as only 43 out of 92 papers presenting quantitative data use statistical tests, and only 16 out of 47 papers presenting qualitative data follow a coding scheme. Only 18 papers report controlled trials. In addition, almost all authors only contribute to one publication, an indication that few groups are specializing on these topics. We then synthesize the results of the existing literature to give insights into what the corpus reveals about how we should teach algorithms. Broadly, we find that much of the literature explores implementing well-established practices, such as active learning or automated assessment, in the algorithms classroom. However, there are algorithms-specific results as well: A number of papers find that students may under-utilize certain algorithmic design techniques, and studies describe a variety of ways to select algorithms problems that increase student engagement and learning. The results we present, along with the publicly available set of papers collected, provide a detailed representation of the current corpus of CS Education work related to algorithm design and can orient further research in the area.Keywords
Funding Information
- National Science Foundation (2313998 and 2434362)
This publication has 87 references indexed in Scilit:
- Student misconceptions of dynamic programming: a replication studyComputer Science Education, 2022
- Identification and addressing reduction-related misconceptionsComputer Science Education, 2016
- Developing and validating test items for first-year computer science coursesComputer Science Education, 2014
- Optimists have more fun, but do they learn better? On the influence of emotional and social factors on learning introductory computer scienceComputer Science Education, 2008
- A Classification of Recent Australasian Computing Education PublicationsComputer Science Education, 2007
- Do senior CS students capitalize on recursion?2004
- Graph Magic: A Visual Graph Package for StudentsComputer Science Education, 2003
- A Meta-Study of Algorithm Visualization EffectivenessJournal of Visual Languages & Computing, 2002
- Organizing knowledge syntheses: A taxonomy of literature reviewsKnowledge and Policy, 1988
- Measuring nominal scale agreement among many raters.Psychological Bulletin, 1971