Enhancements In Sorting Algorithms: A Review


  • Shama Raheja Chitkara university, Punjab, India
  • Vinay kukreja Chitkara university, punjab, India




sorting techniques, enhanced sorting, bubble sort, selection sort, insertion sort, merge sort, complexities


One of the important issues in designing algorithms is to arrange a list of items in particular order. Aalthough there is a large number of sorting algorithms, sorting problem has concerned a great compact of research, because efficient sorting is important to optimize the use of other algorithms. In many applications, sorting plays an important role as to easily handling of the data by arranging it in ascending or descending order.[2] In this paper, we are presenting enhancements in various sorting algorithms such as bubble sort, insertion sort, selection sort, and merge sort. Aa sorting algorithm consists of comparison, swap, and the use of assignment operations. Bubble sort, selection sort and insertion sort are algorithms, which are easy to understand but have the worst time complexity of O (n2). The new algorithms are discussed, analyzed, tested, and executed for reference. Eenhanced selection sort is based on sorting the items by making it slightly faster and stable sorting algorithm. Mmodified bubble sort is an modification on both bubble sort and selection sort algorithms with O (n log n) complexity instead of O (n2) for bubble sort and selection sort algorithms. [3] [1].


Download data is not yet available.


[1] Cormen T., Leiserson C, Rivest R. and Stein C, Introduction to Algorithms, McGraw Hill, 2001.
[2] D. Knuth, “The art of Computer programming Sorting and Searching”, 2nd edition, Addison-Wesley, vol. 3, (1998).
[3] Deitel H. and Deitel P., C++ how to Program, Prentice Hall, 2001.
[4] E. Horowitz, S. Sahni and S. Rajasekaran, Computer algorithms, Galgotia Publications
[5] Harish Rohil, Manisha, International Journal of Computer Trends and Technology (IJCTT) volume 14 number 1 – Aug 2014 ISSN:2231–2803 “Run Time Bubble Sort–an enhancement of Bubble Sort”. http://www.cs.fit.edu/~pkc/classes/writing/hwl3/song.pdf
[6] Jehad Alnihoud and Rami Mansi, “An enhancement in major Sorting algorithms,” The International Arab Journal of Information Technology, Vol. 7, no. 1, January 2010.
[7] M. A. Bender, M. Farach-Colton and M.A. Mosteiro, “Insertion Sort is O(n log n)”, Proceedings of the Third International Conference on Fun With Algorithms (FUN), (2004), pp. 16–23
[8] Mansotra and KR. Sourabh, “Implementing Bubble Sort using a new approach,” in proceedings of 5th national Conference; INDIACOM-2011.
[9] Md. Khairullah “enhancing Worst Sorting algorithms” International Journal of Advanced Science and Technology Vol. 56, July 2014
[10] S. Chand, T. Chaudhary and R. Parveen, “upgraded Selection Sort”, International Journal on Computer Science and Engineering (IJCSE), ISSN: 0975-3397, vol.3, no. 4, (2011), pp.1633–1637.
[11] S. Jadoon, S. F. Solehria, S. Rehman and H. Jan, “Design and analysis of Optimized Selection Sort algorithm”, International Journal of electric & Computer Sciences (IJECS-IJENS), vol. 11, no. 01, pp. 16–22.
[12] Shubham Saini, Bhavesh kasliwal. “MODIFIED MERGE SORT ALGORITHM”. International Journal For Technological Research In engineering Vol. 1, Issue. 1, Sep–2013
[13] Song Qin. Merge Sort algorithm. Florida Institute of Technology.
[14] T. S. Sodhi, S. Kaur and S. Kaur, “enhanced Insertion Sort algorithm”, International Journal of Computer Applications, vol. 64, no. 21, (2013), pp. 35–39.




How to Cite

Shama Raheja, & Vinay kukreja. (2015). Enhancements In Sorting Algorithms: A Review. Journal on Today’s Ideas - Tomorrow’s Technologies, 3(1), 73–82. https://doi.org/10.15415/jotitt.2015.31005