A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study

Authors

  • Shastri S Dept. of Computer Science and IT, Kathua Campus, University of Jammu, Kathua, India
  • Mansotra V Dept. of Computer Science and IT, University of Jammu, Jammu, India
  • Singh Bhadwal A Dept. of Computer Science and IT, Kathua Campus, University of Jammu, Kathua, India
  • Kumari M Dept. of Computer Science and IT, Ramnagar Campus, University of Jammu, Udhampur, India
  • Khajuria A Dept. of Computer Science and IT, Bhaderwah Campus, University of Jammu, Bhaderwah, India
  • Singh Jasrotia D Dept. of Computer Science and IT, Bhaderwah Campus, University of Jammu, Bhaderwah, India

DOI:

https://doi.org/10.26438/ijcse/v5i11.217221

Keywords:

Algorithm, Complexity, Runing Time, Sorting, Data Structures

Abstract

The analysis of algorithms is a subject that has always arouses enormous inquisitiveness. It helps us to determine the efficient algorithm in terms of time and space consumed. There are valid methods of calculating the complexity of an algorithm. In general, a suitable solution is to calculate the run time analysis of the algorithm. The present study documents the comparative analysis of seven different sorting algorithms of data structures viz. Bubble sort, Selection sort, Insertion sort, Shell sort, Heap sort, Quick sort and Merge sort. The implementation is carried out in Visual Studio C# by creating a Graphical User Interface to calculate the running time of these seven algorithms.

References

S. K. Basu, “Design Methods and Analysis of Algorithms”, PHI Publication, India, 2005.

Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, Universities Press Publication, India, 2009.

ISRD Group, “Data Structures using C”, Tata McGraw-Hill Publication, India, 2006.

R. S. Salaria, “Data Structures & Algorithms Using C”, Khanna Book Publication, India, 2012.

Narasimha Karumanchi, “Data Structures and Algorithms Made Easy in Java”, CareerMonk Publication, India, 2015.

The GeeksQuiz website. [Online].

Available: http://quiz.geeksforgeeks.org

Sonal Beniwal and Deepti Grover, “Comparison of Various Sorting Algorithms: A review”, International Journal of Emerging Research in Management & Technology, Vol.2, Issue.5, pp.83-86, 2013.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Prentice-Hall Publisher, India, 2001.

Miraj Gul, Noorul Amin and M. Suliman, “An Analytical Comparison of Different Sorting Algorithms in Data Structure”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol.5, Issue.5, pp.1289-1298, 2015.

Yashavant Kanetkar, “Data Structures through C”, BPB Publication, India, 2010.

Bremananth R, Radhika. V and Thenmozhi. S, “Visualization of Searching and Sorting Algorithms”, International Journal of Computer, Electrical, Automation, Control and Information Engineering, Vol.3, No.3, pp.633-641, 2009.

Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, “Algorithms”, Tata McGraw-Hill Publication, India, 2009.

Narasimha Karumanchi, “Data Structures and Algorithms Made Easy”, CareerMonk Publication. India, 2011.

Sourabh Shastri, “Studies on the Comparative Analysis and Performance Prediction of Sorting Algorithms in Data Structures”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 4, No. 5, pp. 1187-1190, 2014.

Sourabh Shastri, Prof. Vibhakar Mansotra and Anand Sharma, “Sorting Algorithms and their Run-Time Analysis with C#”, International Journal of Computer Science and Information Technology & Security, Vol. 5, No.5, pp. 388-395, 2015.

Downloads

Published

2025-11-12
CITATION
DOI: 10.26438/ijcse/v5i11.217221
Published: 2025-11-12

How to Cite

[1]
S. Shastri, V. Mansotra, A. Singh Bhadwal, M. Kumari, A. Khajuria, and D. Singh Jasrotia, “A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study”, Int. J. Comp. Sci. Eng., vol. 5, no. 11, pp. 217–221, Nov. 2025.

Issue

Vol. 5 No. 11 (2017): IJCSE November Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.