DIGITAL LIBRARY
THE IMPORTANCE OF A SIMPLE COMPUTER GAME WHEN CREATING SORTING ALGORITHMS
1 Trnava University, Faculty of Education (SLOVAKIA)
2 J. Selye University in Komárno, Faculty of Economics and Informatics (SLOVAKIA)
About this paper:
Appears in: INTED2021 Proceedings
Publication year: 2021
Pages: 4893-4899
ISBN: 978-84-09-27666-0
ISSN: 2340-1079
doi: 10.21125/inted.2021.0988
Conference name: 15th International Technology, Education and Development Conference
Dates: 8-9 March, 2021
Location: Online Conference
Abstract:
Arranged sequences of elements can significantly simplify the solution of some problems. For example, searching, selecting, inserting a new element so that the order is not disturbed, and others. Therefore, due attention is paid to sorting algorithms in programming. For the propaedeutics of sorting algorithms in teaching, we use a simple computer game, where the goal is to arrange packages according to (unknown) weight. The player has a typical two-arm scale at his disposal, with which he can compare the weight of two packages with each other. The problem must be solved with minimal number of comparisons. The game has more difficulty levels, depending on the number of packages. During the game, the player builds a certain "winning" strategy, which results in an optimal sorting algorithm with minimal number of comparisons.

The article reports on how students of computer science teaching assess this simple didactic game and how they characterize its importance in education. Especially its influence on the development of logical, algorithmic and strategic thinking of students. When demonstrating how the individual sorting algorithms work, we will also explain how by placing the package from the comparison the result of the comparison can be encoded. We will also show the importance of this computer game in testing knowledge of algorithms and programming and logical decision making for the next step during sorting. The game can also be used to practice or apply various sorting algorithms.

With the help of a pedagogical experiment, we traced how students of computer science teacher program achieve an algorithmic solution of the sorting problem by playing a simple computer game. We were also interested in how their logical and algorithmic thinking evolved during the game. How many iterations do they need to build an optimal sorting algorithm without unnecessary comparisons - that is, the algorithm with the minimum complexity.
Keywords:
Computer game, programming, sorting algorithm, algorithm visualization, simulation.