Sorting Algorithms Demystified: A Comprehensive Guide with the ISort Visualizer
Keywords:
Sorting algorithms, analysisAbstract
Sorting algorithms are essential elements of computer science and data processing, and their comprehension is vital for programmers at all levels of expertise. This article aims to provide 'ISort,' an innovative and interactive sorting visualizer created to enhance understanding and study of different sorting algorithms."ISort" offers a unique approach to visualizing sorting algorithms, allowing users to gain a deeper understanding of how these algorithms function and how effective they are, all through an easy-to-use and intuitive interface. The 'ISort' visualizer employs diverse sorting algorithms, including bubble, insertion, selection, merge, quicksort, and others, to demonstrate their contrasting execution and performance characteristics. A visualizer tool allows users to modify the sizes of the input data, the speed at which the sorting occurs, and the visual signals to observe the process in a step-by-step manner and gain a fundamental understanding of the workings of any algorithm. The application also provides users real-time performance indicators, such as comparison count and time complexity, to help them accurately evaluate and compare different sorting methods. This paper not only discusses the technical features of 'ISort,' including its architecture and implementation but also emphasizes its pedagogical and practical importance. 'ISort' endeavors to be a beneficial resource for educators, students, and developers who wish to increase their comprehension of sorting algorithms. Additionally, it provides a platform for the exploration and experimentation of novel algorithms. 'ISort' enhances the accessibility and engagement of sorting algorithms for a wider audience by integrating an informative and user-friendly interface with extensive algorithm coverage.
Downloads
References
M. Marcellino, D. W. William, S. S. Suntiarko, and K. Margi, “Comparative of Advanced Sorting Algorithms (Quick Sort, Heap Sort, Merge Sort, Intro Sort, Radix Sort) Based on Time and Memory Usage,” Oct. 2021.
1109/ICCSAI53272.2021.9609715.
A. K. Thakkar, S. Dash, and S. Joshi, “Sorting Algorithm visualizer,” Jan. 2023.
A. Trivedi, K. Pandey, V. Gupta, and M. K. Jha, “AlgoRhythm - A Sorting and Path-finding visualizer tool to improve existing algorithms teaching methodologies,” Feb. 2023. 10.1109/Confluence56041.2023.10048793
B. Goswami,A. Dhar, A. Gupta, and A. Gupta, “Algorithm Visualizer: Its features and working,” Jan. 2022.10.1109/UPCON52273.2021.9667586
V. Gupta, “Visualizing, Designing, and Analyzing the Merge Sort Algorithm Retrieved September 10, 2023 from https://medium.com/javarevisited/visualizing-designing-and-analyzing-the-merge-sort-algorithm-904ceb78a592,” Mar. 2023.
W. H. Lim, Y. Cai, D. Yao, and Q. Cao, “Visualize and Learn Sorting Algorithms in Data Structure Subject in a Game-based Learning.,” Dec. 2022.10.1109/ISMAR-Adjunct57072.2022.00083
MahfuzRifat.(n.d.). Sorting Visualizer. Retrieved from https://mahfuzrifat7.github.io/SortingVisualizer/
A. Jain, “Realizing Algorithms Using GUI,” Dec. 2021. 10.1109/SMART52563.2021.9676269
J. Lobo and S. Kuwelkar, “Performance Analysis of Merge Sort Algorithms,” Aug. 2020.
A. Prakash, “Sorting visualizers using JavaScript. Retrieved fromhttps://www.youtube.com/watch?v=cW16SGqr_Lg,”
G. Prabhakar, S. Gaur, L. Deshwal, and P. Jain, “Analysis of Algorithm Visualizer to Enhance Academic Learning” Apr. 2022.10.1109/ICIPTM54933.2022.9753906.
C. Mihailescu, “Sorting Visualizer [Computer software]. Retrieved fromhttps://clementmihailescu.github.io/Sorting-Visualizer/,”
Code Drifter. (Year). Sorting Visualizer using JavaScript
D. Khanduja and A. Dhawan, “Comparative analysis of sorting algorithms through visualization tools,” International Journal of Computer Applications, vol. 42, no. 14, pp. 23-29, 2012.
J. Hartman, “Sorting Visualizer. [Computer software],” 2021.
Q. Cutts andJ. Bishop, “Sorting out sorting: A classroomactivity for teaching sorting algorithms,” Journal of Computing Sciences in Colleges, vol. 30, no. 5, pp. 15-22, 2015.
Y. Chrysanthou and C. Chrysanthou, “Interactive visualization of sorting algorithms using OpenGL,” Computer Science Journal of Moldova, vol. 21, no. 3, pp. 352-375, 2013.
E. Halverson and C. Rogers, “A review of research on sorting algorithms: A human-centered perspective. ACM SIGCSE Bulletin,” vol. 50, no. 1, pp. 39-155, 2018.
M. Moshtaghi and K. Wilkinson, “Improving student learning of sorting algorithms through algorithm animation and performance analysis,” Computer Science Education, vol. 27, no. 3, pp. 255-275, 2017.
S. Palmiter and K. Boese, “Visualizing sorting algorithms using music,” Journal of Computing Sciences in Colleges, vol. 31, no.5, pp. 101-108, 2016.
G. Prabhakar, S. Gaur, L. Deshwal, and P. Jain, “Analysis of Algorithm Visualizer to Enhance Academic Learning,” IEEE, vol. 2, pp. 279-282, 2022.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
