Serious Sorting: A Serious Game to Learn, Understand, and Explore Different Sorting Algorithms Across Data Types

Abstract

Sorting algorithms are a core component of computer science that involves the process of rearran- ging data in a specific order. Because of their abstract and procedural nature, they remain difficult to fully grasp for students in computer science education. Traditionally, these concepts are taught through pseudocode and visualizations, such as diagrams or animations. However, these are pass- ive ways of learning sorting algorithms that lead to students memorizing steps rather than truly comprehending the conceptual differences between algorithms and understanding when to apply which one. This thesis investigates whether a serious game can enhance students’ understanding of sorting algorithms by providing an interactive environment that visualizes the algorithm’s be- havior. The developed program is a card game that allows players to manipulate the data directly, receive immediate feedback and scoring, and explore how different input structures influence al- gorithm performance. The game was evaluated through a pre- and post-test study, along with gameplay metrics and participant feedback. Results show improved understanding and higher engagement compared to traditional learning methods, suggesting that serious games that contain interactivity, visualization, and gamification elements can be an effective educational method for learning sorting algorithms. Although the study is limited by the absence of long-term meas- urements, the findings indicate that serious games can serve as valuable complementary tools in algorithm education.