Research Article
A Visual Tool to Study Sorting Algorithms and Their Complexity
@INPROCEEDINGS{10.1007/978-3-031-17292-2_15, author={Tanyo Kostadinov and Ivon Nikolova and Radoslav Radev and Angel Terziev and Lasko Laskov}, title={A Visual Tool to Study Sorting Algorithms and Their Complexity}, proceedings={Computer Science and Education in Computer Science. 18th EAI International Conference, CSECS 2022, On-Site and Virtual Event, June 24-27, 2022, Proceedings}, proceedings_a={CSECS}, year={2022}, month={11}, keywords={Algorithms and data structures Sorting algorithms Informatics education}, doi={10.1007/978-3-031-17292-2_15} }- Tanyo Kostadinov
Ivon Nikolova
Radoslav Radev
Angel Terziev
Lasko Laskov
Year: 2022
A Visual Tool to Study Sorting Algorithms and Their Complexity
CSECS
Springer
DOI: 10.1007/978-3-031-17292-2_15
Abstract
Sorting algorithms are a well-known part of the curriculum in programming courses in the academia. They are taught not only because their numerous applications in practice, but also because they are a good and a comprehensive introduction to the topic of computer algorithms. However, theasymptotic notationused to describe algorithm complexity is not intuitive for beginners. A visual tool that demonstrates both the algorithm’s steps and its time complexity makes the abstract notionasymptotic notationmore intuitive, and can improve the learning curve of the students.
Copyright © 2022–2025 ICST
