IJCRR - 9(11), June, 2017
Pages: 64-67
Performance Visualization of Gnome Sort in Worst Case Implemented Using R in Three Personal Computers
Author: Dipankar Das, Priyanka Das, Rishab Dey, Sreya Modak
Category: Technology
[Download PDF]
Abstract:
Aim: To visualize the performances of the Gnome sort in the worst case in three different personal computers and to identify through visual inspection whether the performances of the Gnome Sort in the worst case follows quadratic nature or not.
Methodology: The Gnome sort algorithm is implemented using R. For the purpose of the study, the researchers have used three (3) different personal computers having different configurations. The entire experiment have been carried out for data size one hundred (100) to data size two thousand (2000) with an interval of one hundred (100). The performances (data size versus average run time in seconds) of Gnome sort algorithm in the worst case in all the three personal computers are visualized using scatter plots and quadratic curves.
Results: The performances of Gnome sort in the worst case implemented using R in all the three personal computers under study shows similar patterns which are very close to quadratic curves.
Conclusion: From the study using visual inspections, we may conclude that the performances of Gnome sort in the worst case in all the three (3) cases are approximately following quadratic nature.
Keywords: Gnome sort, Worst Case, Performance Visualization
Citation:
Dipankar Das, Priyanka Das, Rishab Dey, Sreya Modak. Performance Visualization of Gnome Sort in Worst Case Implemented Using R in Three Personal Computers International Journal of Current Research and Review. 9(11), June, 64-67
References:
[1] Han, B. (n.d.). CSED233: Data Structures (2015F) - Lecture3: Algorithm Analysis [PDF]. Retrieved March 30, 2017, from http://cvlab.postech.ac.kr/~bhhan/class/cse233_2015f/csed233_lecture3.pdf
[2] Hoos, H. H. (n.d.). CPSC 590 (AUTUMN 2003) - INTRODUCTION TO EMPIRICAL ALGORITHMICS [PDF]. Retrieved March 30, 2017, from http://www.sls-book.net/Slides/sls-empalg.pdf
[3] Bostock, M. (2014, June 26). Visualizing Algorithms. Retrieved April 06, 2017, from https://bost.ocks.org/mike/algorithms/
[4] Sarbazi-Azad, H. (2000, October 2). Stupid Sort: A new sorting algorithm. News letter (Computing Science GLASGOW), 599, 4. Retrieved March 31, 2017, from http://sina.sharif.edu/~azad/stupid-sort.PDF
[5] Grune, D. (n.d.). Gnome Sort - The Simplest Sort Algorithm. Retrieved March 31, 2017, from https://dickgrune.com/Programs/gnomesort.html
[6] Hammad, J. (2015). A Comparative Study between Various Sorting Algorithms. International Journal of Computer Science and Network Security, 15(3), 11-16. Retrieved March 31, 2017, from http://paper.ijcsns.org/07_book/201503/20150302.pdf
[7] Pandey, R. C. (2008). Study and Comparison of various sorting algorithms. Thapar University, Patiala. Retrieved March 21, 2017, from http://dspace.thapar.edu:8080/jspui/bitstream/10266/583/3/T583.pdf
Thesis submitted in partial fulfillment of the requirements for the award of degree of Master of Engineering, in Computer Science & Engineering Under the supervision of: Mrs. Shivani Goel, Lecturer, CSED
[8] Mishra, A. D., & Garg, D. (2008). SELECTION OF BEST SORTING ALGORITHM. International Journal of Intelligent Information Processing, 2(2), 363-368. Retrieved March 31, 2017, from http://gdeepak.com/pubs/Selection%20of%20best%20sorting%20algorithm.pdf
[9] Rao, D. T. V. D., & Ramesh, B. (2012). Experimental Based Selection of Best Sorting Algorithm. International Journal of Modern Engineering Research (IJMER), 2(4), 2908-2912. Retrieved March 31, 2017, from https://pdfs.semanticscholar.org/295e/e11e71ff42e4d74dbc83d320d462d4695e67.pdf
[10] Kaur, S., Singh, H., & Singh, P. (2013). COMPARISON BASED IDENTIFICATION OF SORTING ALGORITHM FOR A PROBLEM. International Journal of Advanced Computational Engineering and Networking, 1(1), 67-75. Retrieved March 31, 2017, from http://www.iraj.in/journal/journal_file/journal_pdf/3-18-139082309867-75.pdf
[11] Meolic, R. (2013). Demonstration of Sorting Algorithms on Mobile Platforms. In CSEDU (pp. 136-141). Retrieved March 31, 2017, from http://lms.uni-mb.si/~meolic/papers/meolic-csedu13-extended.pdf
|