Skip to main content

Using Interactive Card Animations for Understanding of the Essential Aspects of Non-recursive Sorting Algorithms

  • Conference paper
  • First Online:
Proceedings of the 2015 Federated Conference on Software Development and Object Technologies (SDOT 2015)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 511))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Rudder, A., Bernard, M., Mohammed, S.: Teaching programming using visualization. In: Proceedings of the Sixth IASTED International Conference on Web-Based Education, pp. 487–492 (2007)

    Google Scholar 

  2. Naps, T.L., Rößling, G., Almstrum, V., Dann, W., Fleischer, R., Hundhausen, C., et al.: Exploring the role of visualization and engagement in computer science education. SIGCSE Bull. 35, 131–152 (2002)

    Article  Google Scholar 

  3. Byrne, M.D., Catrambone, R., Stasko, J.T.: Evaluating animations as student aids in learning computer algorithms. Comput. Educ. 33, 253–278 (1999)

    Article  Google Scholar 

  4. Hansen, S., Narayanan, N.H., Hegarty, M.: Designing educationally effective algorithm visualizations. J. Vis. Lang. Comput. 13, 291–317 (2002)

    Article  Google Scholar 

  5. Kann, C., Lindeman, R.W., Heller, R.: Integrating algorithm animation into a learning environment. Comput. Educ. 28, 223–228 (1997)

    Article  Google Scholar 

  6. Kehoe, C., Stasko, J., Taylor, A.: Rethinking the evaluation of algorithm animations as learning aids: an observational study. Int. J. Hum Comput Stud. 54, 265–284 (2001)

    Article  MATH  Google Scholar 

  7. Mayer, R.E.: Multimedia Learning, 2nd edn. Cambridge University Press, New York (2009)

    Book  Google Scholar 

  8. Fleischer, R., Kucera, L.: Algorithm animation for teaching. Softw. Vis. 2269, 113–128 (2002)

    Article  MATH  Google Scholar 

  9. Grissom, S., McNally, M.F., Naps, T.: Algorithm visualization in CS education: comparing levels of student engagement. In: Presented at the Proceedings of the 2003 ACM Symposium on Software Visualization, San Diego, California (2003)

    Google Scholar 

  10. Hundhausen, C.D., Douglas, S.A., Stasko, J.T.: A meta-study of algorithm visualization effectiveness. J. Vis. Lang. Comput. 13, 259–290 (2002)

    Article  Google Scholar 

  11. Végh, L.: From Bubblesort to Quicksort with Playing a Game (Hravou formou od bublinkového triedenia po rýchle triedenie). In: XXIX International Colloquium on the Management of Educational Process, Brno, CZ, pp. 539–549 (2011)

    Google Scholar 

  12. Anderson, L.W., Krathwohl, D.R., Airasian, P.W., Cruikshank, K.A., Mayer, R.E., Pintrich, P.R., et al.: A Taxonomy for Learning, Teaching, and Assessing. A Revision of Bloom’s Taxonomy of Educational Objectives. Addison Wesley Longman Inc, USA (2001)

    Google Scholar 

Download references

Acknowledgment

The contribution was published thanks to grant KEGA, 010UJS-4/2014 Modeling, simulation and animation in education (Modelovanie, simulácia a animácia vo vzdelávaní).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ladislav Végh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Végh, L., Takáč, O. (2017). Using Interactive Card Animations for Understanding of the Essential Aspects of Non-recursive Sorting Algorithms. In: Janech, J., Kostolny, J., Gratkowski, T. (eds) Proceedings of the 2015 Federated Conference on Software Development and Object Technologies. SDOT 2015. Advances in Intelligent Systems and Computing, vol 511. Springer, Cham. https://doi.org/10.1007/978-3-319-46535-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46535-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46534-0

  • Online ISBN: 978-3-319-46535-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics