The teaching of sorting algorithms is an essential topic in undergraduate computing courses. Typically the courses are taught through traditional lectures and exercises involving the implementation of the algorithms. As an alternative, this article presents the design and evaluation of three educational games for teaching Quicksort and Heapsort. The games have been evaluated in a series of case studies, including 23 applications of the games in data structures courses at the Federal University of Santa Catarina with the participation of a total of 371 students. The results provide a first indication that such educational games can contribute positively to the learning outcome on teaching sorting algorithms, supporting the students to achieve learning on higher levels as well as to increase the students’ motivation on this topic. The social interaction the games promote allows the students to cooperate or compete while playing, making learning more fun.

中文翻译：

---

教学排序算法的教育游戏设计与大规模评估

排序算法的教学是本科计算机课程中必不可少的主题。通常，通过涉及算法实现的传统讲座和练习来教授课程。作为替代方案，本文介绍了三种教学Quicksort和Heapsort的教育游戏的设计和评估。在一系列案例研究中对游戏进行了评估，其中包括23种游戏在圣卡塔琳娜联邦大学数据结构课程中的应用，共有371名学生参加。结果提供了第一个迹象，表明此类教育游戏可以对教学排序算法的学习成果做出积极贡献，支持学生在更高水平上学习，并增加学生在该主题上的动力。