Using interactive card animations for understanding of the essential aspects of non-recursive sorting algorithms

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Animations can help students to comprehend computer science algorithms. Previous experiments, mentioned in this paper, show that interactivity is very important in educational animations. In this contribution we also describe three categories of algorithm animations with different views, and we introduce our interactive card animations that belong to the first group (animations with conceptual views). These card animations of sorting algorithms were used in our experiment, where first-year computer science students were asked to fill out a pre-test, use the animations, and fill out a post-test. In the third part of the paper we discuss the obtained results, which proved that the interactive card animations can help students to understand the essential aspects of different sorting algorithms. Finally, we draw conclusions and introduce our future plans.

Cite

CITATION STYLE

APA

Végh, L., & Takáč, O. (2017). Using interactive card animations for understanding of the essential aspects of non-recursive sorting algorithms. In Advances in Intelligent Systems and Computing (Vol. 511 AISC, pp. 336–347). Springer Verlag. https://doi.org/10.1007/978-3-319-46535-7_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free