Enhancing and Optimization Sorting Algorithms: An Empirical Study

Mohammad Mehdi KARIMIZADEH, Ehsan RAFEAZADEH, Pouran AMIRI, Dariush KHOLGHNIK
2.230 1.268

Abstract


Abstract. Sorting algorithms are used to sort a list of data. Also sorting is used in other computer operations such as searching, merging, and normalization. Since the sorting is considered as a one of the key operation in computer science, recognition of an optimization approaches can develop this science considerably. Optimization in the sorting algorithms, even in small scale, can cause saving a lot of time.  The main discussion of the paper is on those algorithms which present optimized versions of classical sort algorithms. We studied classical and optimized methods some of sorting algorithm such as Selection sort, Bubble sort, Insertion sort, Quick sort and Heap sort and compared each algorithm in terms of the running times when used for sorting arrays of integers.


Keywords


Sorting Algorithm, Classic Sorting Method, Optimized Sorting Method, Optimization algorithm

Full Text:

PDF


References


Al-Kharabsheh, K. S., AlTurani, I. M., AlTurani, A. M. I., & Zanoon, N. I. (2013). Review on Sorting Algorithms A Comparative Study. International Journal of Computer Science and Security (IJCSS), 7(3), 120-126.

Alnihoud, J., & Mansi, R. (2010). An Enhancement of Major Sorting Algorithms. The International Arab Journal of Information Technology, 7(1), 55-62.

Khairullah, M. (2013). Enhancing Worst Sorting Algorithms. International Journal of Advanced Science and Technology, 56, 13-26.

Khreisat, L. (2007). Quicksort A Historical Perspective and Empirical Study. International Journal of Computer Science and Network Security (IJCSNS), 7(12), 54-65. [5]

Kumar Karunanithi, A. (2014). A Survey, Discussion and Comparison of Sorting Algorithms. Master's Thesis, Department of Computing Science Ume'a University, Sweden.

Levendeas, D., & Zaroliagis, C. (2008). Heap sort using Multiple Heaps. 2nd Panhellenic Student Conference on Informatics, EUREKA 2008, Research Gate, Samos, Greece, 93-104. Mishra, A. D., & Garg, D. (2008). Selection of Best Sorting Algorithm. International Journal of Intelligent Information Processing, 2(2), 363-368.

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. Savina, & Kaur, S. (2013). Study of Sorting Algorithm to Optimize Search Results. International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), 2(1), 204-207.

Wainright, R. L. (1987). Quicksort algorithms with an early exit for sorted subfiles. Comm. ACM, 183 190.