Open Access   Article Go Back

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

Sourabh Shastri1 , Vibhakar Mansotra2 , Arun Singh Bhadwal3 , Monika Kumari4 , Avish Khajuria5 , Dalbir Singh6

  1. Dept. of Computer Science and IT, Kathua Campus, University of Jammu, Kathua, India.
  2. Dept. of Computer Science and IT, University of Jammu, Jammu, India.
  3. Dept. of Computer Science and IT, Kathua Campus, University of Jammu, Kathua, India.
  4. Dept. of Computer Science and IT, Ramnagar Campus, University of Jammu, Udhampur, India.
  5. Dept. of Computer Science and IT, Bhaderwah Campus, University of Jammu, Bhaderwah, India.
  6. Dept. of Computer Science and IT, Bhaderwah Campus, University of Jammu, Bhaderwah, I.

Correspondence should be addressed to: sourabhshastri@gmail.com.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-11 , Page no. 217-221, Nov-2017

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v5i11.217221

Online published on Nov 30, 2017

Copyright © Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh , “A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.11, pp.217-221, 2017.

MLA Style Citation: Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh "A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study." International Journal of Computer Sciences and Engineering 5.11 (2017): 217-221.

APA Style Citation: Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh , (2017). A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study. International Journal of Computer Sciences and Engineering, 5(11), 217-221.

BibTex Style Citation:
@article{Shastri_2017,
author = {Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh },
title = {A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {11 2017},
volume = {5},
Issue = {11},
month = {11},
year = {2017},
issn = {2347-2693},
pages = {217-221},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1569},
doi = {https://doi.org/10.26438/ijcse/v5i11.217221}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i11.217221}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1569
TI - A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study
T2 - International Journal of Computer Sciences and Engineering
AU - Sourabh Shastri, Vibhakar Mansotra, Arun Singh Bhadwal, Monika Kumari, Avish Khajuria, Dalbir Singh
PY - 2017
DA - 2017/11/30
PB - IJCSE, Indore, INDIA
SP - 217-221
IS - 11
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
671 431 downloads 318 downloads
  
  
           

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.

Key-Words / Index Term

Algorithm, Complexity, Runing Time, Sorting, Data Structures

References

[1] S. K. Basu, “Design Methods and Analysis of Algorithms”, PHI Publication, India, 2005.
[2] Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, Universities Press Publication, India, 2009.
[3] ISRD Group, “Data Structures using C”, Tata McGraw-Hill Publication, India, 2006.
[4] R. S. Salaria, “Data Structures & Algorithms Using C”, Khanna Book Publication, India, 2012.
[5] Narasimha Karumanchi, “Data Structures and Algorithms Made Easy in Java”, CareerMonk Publication, India, 2015.
[6] The GeeksQuiz website. [Online].
Available: http://quiz.geeksforgeeks.org
[7] 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.
[8] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Prentice-Hall Publisher, India, 2001.
[9] 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.
[10] Yashavant Kanetkar, “Data Structures through C”, BPB Publication, India, 2010.
[11] 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.
[12] Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, “Algorithms”, Tata McGraw-Hill Publication, India, 2009.
[13] Narasimha Karumanchi, “Data Structures and Algorithms Made Easy”, CareerMonk Publication. India, 2011.
[14] 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.
[15] 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.