Interactive Visualization and Analysis of Sorting Algorithms

Year : 2026 | Volume : 04 | Issue : 02 | Page : 9 18
By

Rajhans Rushikesh Anilrao,

Karthik Reddy,

Vaishnavi Biradar,

  1. Research Scholar, Thakur Institute of Management Studies, Career Development & Research (TIMSCDR), Maharashtra, India
  2. Research Scholar, Thakur Institute of Management Studies, Career Development & Research (TIMSCDR), Maharashtra, India
  3. Assistant Professor, Thakur Institute of Management Studies, Career Development & Research (TIMSCDR), Maharashtra, India

Abstract

This paper describes a complete review of pedagogical barriers to teaching algorithms, including the development of an interactive visualization and analysis tool in Java to represent three commonly used sorting algorithms: Quick Sort, Merge Sort, and Heap Sort. Sorting algorithms are a critical part of many types of data processing, but for some students they can be challenging to visualize or conceptualize as a series of steps because traditional methods of teaching these algorithms tend to emphasize the mathematical nature of algorithms rather than the individual steps of their implementations. The main purpose of this research is to develop and evaluate an interactive visualization tool to provide users with animated representations of algorithm execution, while gathering quantitative metric data, such as execution time, number of swaps, number of comparisons, and total memory used. The system is also capable of allowing users to modify input data distributions to compare algorithmic performance under different input conditions and to control how quickly animations play back. The educational benefits of using this type of visualization tool were evaluated through an empirical study involving 30 undergraduate computer science students and a comparison of mean comprehension score improvement from pre-testing (prior to using the visualization tool) to post-testing following use of the tool. The mean comprehension score improvement of 54.7% following use of the tool was statistically confirmed using a paired t-test (p < 0.001). This statistically significant improvement indicates that the use of interactive visualizations is an effective means of improving a learner's conceptual understanding. Based upon these findings, incorporating interactive visualizations into algorithm education will enhance learners' conceptual understanding, increase their engagement, and improve their retention of material learned.

Keywords: Sorting algorithms, visualization, Quick Sort, Merge Sort, Heap Sort, educational technology, performance analysis, Java, interactive learning, algorithm animation

[This article belongs to International Journal of Data Structure Studies ]

How to cite this article: Rajhans Rushikesh Anilrao, Karthik Reddy, Vaishnavi Biradar. Interactive Visualization and Analysis of Sorting Algorithms. International Journal of Data Structure Studies. 2026; 04(02):9-18.
How to cite this URL: Rajhans Rushikesh Anilrao, Karthik Reddy, Vaishnavi Biradar. Interactive Visualization and Analysis of Sorting Algorithms. International Journal of Data Structure Studies. 2026; 04(02):9-18. Available from: https://journals.stmjournals.com/ijdss/article=2026/view=262188

References

  1. Bentley J. Programming pearls: algorithm design techniques. Commun ACM. 1984;27(9):865-71. doi:10.1145/358234.381162.
  2. Adelson-Velskii GM, Landis EM. An algorithm for the organization of information. Sov Math Dokl. 1962;3:1259-63.
  3. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. 3rd ed. Cambridge (MA): MIT Press; 2009.
  4. Knuth DE. The Art of Computer Programming. Vol. 3, Sorting and Searching. 2nd ed. Reading (MA): Addison-Wesley; 1998.
  5. Hoare CAR. Quicksort. Comput J. 1962;5(1):10-6. doi:10.1093/comjnl/5.1.10.
  6. Williams JWJ. Algorithm 232: heapsort. Commun ACM. 1964;7(6):347-8. doi:10.1145/512274.3734138.
  7. Brown MH, Sedgewick R. Techniques for algorithm animation. IEEE Softw. 1985;2(1):28-39. doi:10.1109/MS.1985.229778.
  8. Stasko JT. Tango: a framework and system for algorithm animation. Computer. 1990;23(9):27-39. doi:10.1109/2.58216.
  9. Brown MH. Zeus: a system for algorithm animation and multi-view editing. Technical Report SRC-75. Palo Alto (CA): Digital Equipment Corporation, Systems Research Center; 1992.
  10. Price BA, Baecker RM, Small IS. A principled taxonomy of software visualization. J Vis Lang Comput. 1993;4(3):211-66. doi:10.1006/jvlc.1993.1015.
  11. Hundhausen CD, Douglas SA, Stasko JT. A meta-study of algorithm visualization effectiveness. J Vis Lang Comput. 2002;13(3):259-90. doi:10.1006/jvlc.2002.0237.
  12. Naps TL, Rößling G, Almstrum V, Dann W, Fleischer R, Hundhausen C, et al. Exploring the role of visualization and engagement in computer science education. In: Working group reports from ITiCSE on Innovation and Technology in Computer Science Education; 2002 Jun 24-26; Aarhus, Denmark. New York: Association for Computing Machinery; 2002. p. 131-52. doi:10.1145/960568.782998.
  13. Shaffer CA, Cooper M, Edwards SH. Algorithm visualization: a report on the state of the field. In: Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education; 2007 Mar 7-11; Covington, KY, USA. New York: Association for Computing Machinery; 2007. p. 150-4. doi:10.1145/1227310.1227366.
  14. Shneiderman B. The future of interactive systems and the emergence of direct manipulation. Behav Inf Technol. 1982;1(3):237-56. doi:10.1080/01449298208914450.
  15. Visualising data structures and algorithms through animation. 2026. Available from: https://visualgo.net/en.
  16. Vateha F, Šimoňák S. Comparative visualization of algorithms and data structures. Comput Inform. 2025;44(2):336-65. doi:10.31577/cai_2025_2_336.
  17. Galles D. Data structure visualizations [Online]. San Francisco: University of San Francisco, Department of Computer Science. 2026. Available from: https://www.cs.usfca.edu/~galles/
    Visualization/Algorithms.html.
  18. Bentley JL, McIlroy MD. Engineering a sort function. Softw Pract Exp. 1993;23(11):1249-65. doi:10.1002/spe.4380231105.
  19. Musser DR. Introspective sorting and selection algorithms. Softw Pract Exp. 1997;27(8):983-93. doi:10.1002/(SICI)1097-024X(199708)27:83.0.CO;2-#.
  20. Sedgewick R. Implementing quicksort programs. Commun ACM. 1978;21(10):847-57. doi:10.1145/359619.359631.
  21. Shell DL. A high-speed sorting procedure. Commun ACM. 1959;2(7):30-2. doi:10.1145/368370.368387.
  22. Peters T. Timsort [Online]. Python.org. 2026. Available from: https://bugs.python.org/file4451/timsort.txt.
  23. Dijkstra EW. Smoothsort, an alternative for sorting in situ. Sci Comput Program. 1982;1(3):223-33. doi:10.1016/0167-6423(82)90016-8.
  24. LaMarca A, Ladner RE. The influence of caches on the performance of sorting. J Algorithms. 1999;31(1):66-104. doi:10.1006/jagm.1998.0985.
  25. Bentley J. Programming pearls: how to sort. Commun ACM. 1984;27(4):287. doi:10.1145/358027.381121.
Regular Issue Subscription Review Article
Volume 04
Issue 02
Received 10/03/2026
Accepted 27/06/2026
Published 10/07/2026
Publication Time 122 Days

Login

My IP

PlumX Metrics

Support