Run Time Bubble Sort – An Enhancement of Bubble Sort

International Journal of Computer Trends and Technology (IJCTT)          
© 2014 by IJCTT Journal
Volume-14 Number-1
Year of Publication : 2014
Authors : Harish Rohil , Manisha
DOI :  10.14445/22312803/IJCTT-V14P109


Harish Rohil , Manisha."Run Time Bubble Sort – An Enhancement of Bubble Sort". International Journal of Computer Trends and Technology (IJCTT) V14(1):36-38, Aug 2014. ISSN:2231-2803. Published by Seventh Sense Research Group.

Abstract -
In many real applications, sorting plays an important role as it makes easy to handle the data by arranging it in ascending or descending order, according to requirements. Bubble sort is most common sorting algorithm, but not efficient for many applications. There are number of other sorting algorithms and still, research is going for new sorting algorithms to improve the complexities of existing algorithms whether it is space complexity or it is time complexity. This paper introduces a new algorithm named RTBS (Run Time Bubble Sort). This sorting technique is very simple to implement. It is helpful to reduce the elapsed time when to sort the data. RTBS is compared with original bubble sort algorithm. This sorting technique is tested for average case, best case and the worst case.

[1] Astrachanm O.,Bubble sort: An Archaeological Algorithm Analysis, Duk University, 2003.
[2] Jehad Alnihoud and Rami Mansi, “An Enhancement of Major Sorting Algorithms,” The International Arab Journal of Information Technology, Vol.7, No. 1, January 2010.
[3] V. Mansotra and Kr. Sourabh, “Implementing Bubble Sort Using a New Approach,” in proceedings of 5th National Conference;INDIACom-2011.
[4] Arora Nitin, Kumar vivek and Kumar Suresh. “A Novel Sorting Algorithm and Comparison with Bubble Sort and Insertion Sort,” International Journal of Computer Applications (0975-8887) vol. 45, No. 1, May 2012.
[5] Dmitri Mihhailov, Valery Sklyarov, Iouliia Skliarova and Alexander Sudnitson, “Optimization or Recursive Sorting Algorithms for Implementation in Hardware,” 22nd International conference on Microelectronics (ICM 2010).
[6] Rami Mansi, “Enhanced Quicksort Algorithm ,” The International Arab Journal of Information Technology, Vol.7, No. 2, April 2010.
[7] Kapur Eshan, Kumar Parveen and Gupta Sahil,”Proposal Of A Two Way Sorting Algorithm And Performance Comparison With Existing Algorithms,” International Journal of Computer Science, Engineering and Applications (IJCSEA) vol. 2, No. 3, June 2012.
[8] Sultanullah Jadoon, Salman faiz Solehria, Prof. Dr. Salim Ur Rehman, Prof. Hamid Jan, “Design and Analysis of Optimized Selection Sort Algorithm,” International Journal of Electric and computer sciences IJECS-IJENS VOL. 11, No. 01 pp. 16- 22.
[9] source insertion_sort shtml.
[10] fastest-sorting- algorithm/184404062.
[11] Parag Bhalchandra, Nilesh Deshmukh, Sakharam Lokhande and Santosh Phulari, “A Comprehensive Note On Complexity Issues in Sorting Algorithms,” Advance in Computational Research, ISSN: 0975-3273, Volume 1, Issue 2, 2009 pp. 01-09.
[12] Shahzad B. and Afzal M., “Enhanced Shell Sorting Algorithm,” Computer Journal of Enformatika, vol.21, no. 6, pp. 66-70, 2007.
[13] Shell D, ”A High Speed Sorting Procedure,” Computer Journal of Communications of the ACM vol. 2, No. 7 pp. 30-32, 1959.
[14] Knuth, D. The Art of Computer Programming, Vol. 3: Sorting and Searching, Third edition. Addison-Wesley, 1997. ISBN 0-201-89685-0. pp. 106-110 of section.
[15] Sareen Pankaj, “ Comparison of Sorting Algorithms ( On the Basis of Average case)”, International Journal of Advanced Research in Computer Science and software Engineering ISSn: 2277128x, volume 3, Issue 3, March 2013, pp. 522-532
[16] /NIK-2006-.pdf.
[18] Abdul Wahab Muzaffar, Naveed Riaz, Juwaria Shafiq and Wasi Haider Butt, “ Relative Sp lit and Concatenate Sort (RSCS-VI)”, International Journal of Computer Theory and Engineering vol. 4, No. 2, April 2012.

Sorting algorithm, Bubble sort.