Sorting Visualizer: A Visual Journey Through Sorting Algorithms

Shreya Singh; Shikha Singh; Vineet Singh; Bramah Hazela

doi:10.54060/a2zjournals.jieee.107

Authors

Shreya Singh Amity School of Engineering and Technology, Amity University, Uttar Pradesh, Lucknow, India
Dr. Shikha Singh Amity School of Engineering and Technology, Amity University, Uttar Pradesh, Lucknow, India
Vineet Singh Amity School of Engineering and Technology, Amity University, Uttar Pradesh, Lucknow, India
Dr. Bramah Hazela Amity School of Engineering and Technology, Amity University, Uttar Pradesh, Lucknow, India

DOI:

https://doi.org/10.54060/a2zjournals.jieee.107

Keywords:

Sorting, searching, data structures, complexity

Abstract

This paper, which is based on the importance of sorting algorithms, will carefully compare the features of various algorithms, beginning with their work effectiveness, algorithm execution, introductory concepts, sorting styles, and other aspects, and make conclusions in order to create more effective sorting algorithms. Searching techniques and sorting algorithms are not the same. Sorting is placing the provided list in a predetermined order, which can be either ascending or descending, whereas searching is predicated on the possibility of finding a specific item in the list. Only a section of the data is sorted, and the piece of data that's actually used to establish the sorted order is the key. The maturity of this data is being compared. Depending on the kind of data structure, there are several algorithms for doing the same set of duties and other conditioning, and each has pros and cons of its own. Numerous sorting algorithms have been analysed grounded on space and time complexity. The aim of this relative study is to identify the most effective sorting algorithms or styles. This relative study grounded on the same analysis allows the user to select the applicable sorting algorithm for the given situation.

Downloads

Download data is not yet available.

References

N. Akhter, "Sorting Algorithms – A Comparative Study," International Journal of Computer Science and Information Security (IJCSIS), vol. 14, no. 12, pp. 930-936, (Published: December 2016)

G. Kocher and N. Agrawal, "Analysis and Review of Sorting Algorithms," International Journal of Scientific Engineering and Research (IJSER), vol. 2, no. 3, pp. 81-84.

C. L. Liu, "Analysis of sorting algorithms," AFIPS '73: National computer conference and exposition, 1973.

W. Xiang, "Analysis of the time complexity of quick sort algorithm," International Conference on Information Management, Innovation Management and Industrial Engineering, pp. 408-410, 2011.

J. Lobo and S. Kuwelkar, "Performance analysis of merge sort algorithms," Proceedings of the International Conference on Electronics and Sustainable Communication Systems (ICESC 2020), pp. 110-115, 2020

A. Aishwarya and R. Tiwari, “AN ANALYSIS OF SORTING ALGORITHMS”,” International Research Journal of Modernization in Engineering Technology and Science, 2023.

A. Zutshi and D. Goswami, “Systematic review and exploration of new avenues for sorting algorithm”,” International Journal of Information Management Data Insights, 2021.

S. Md, M. A. Rana, H. Hossin, and M. Jahan, “A New Approach in Sorting Algorithm”,” in 8th International Congress of Information and Communication Technology, (Published: 2019)

D. J. Mankowitz et al., “Faster sorting algorithms discovered using deep reinforcement learning,” Nature, vol. 618, no. 7964, pp. 257–263, 2023.

M. Idrees, “Sorting Algorithms - A Comparative Study,” International Journal of Computer Science and Information Security, 2016.

A. Andersson, Sorting and Searching Revisited”. Sweden (Published, 2005.

J. Hammad, A Comparative Study between Various Sorting Algorithms”. Al-Quds Open University, 2015.

Ms ROOPA, Ms RESHMA J, “A Comparative Study of Sorting and Searching Algorithms”, International Research Journal of Engineering and Technology (IRJET), Vol. 05, Issue 01, 2018.

J. Clément, T. Hien Nguyen Thi, and B. Vallée, “A general framework for the realistic analysis of sorting and searching algorithms,” in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013.

T. Niemann, “Sorting and Searching Algorithms: A Cookbook”, July 2006.