An Enhancement of Bubble Sorting Algorithm

Authors

  • Harsh N Nankani IT department, Vadodara Institute of Engineering, Gujarat Technological University, Vadodara, India
  • Bhandari M CE/IT department, Vadodara Institute of Engineering, Gujarat Technological University, Vadodara, Gujarat, India

Keywords:

Sorting, Bubble sort

Abstract

Sorting is an important technique of data structure which finds its place in many real-life applications. There are various sorting algorithms are in existence till date. In this paper, we have tried to improve upon execution time of the Bubble Sort algorithm by implementing the algorithm using an enhancement of it. An extensive analysis has been done by us on the new algorithm and the algorithm has been compared with the traditional method of Bubble Sort. Observations have been obtained on comparing this new approach with the existing approaches of Bubble Sort. The new proposed approach was tested for Average Case analysis, Best Case analysis and Worst case analysis. It has been analysed that the new approach has given very good results on Average Case and Worst Case analysis. The new approach was tested on random data of various ranges from small to large. It has been observed that the new approach has given efficient results in terms of execution time. Hence, we have reached to the conclusion through the experimental observations that the new algorithm given in this paper is better than the traditional Bubble Sort.

References

Kruse R., and Ryba A., Data Structures and Program Design in C++, Prentice Hall, 1999.

Boolos, George & Jeffrey, Richard (1974, 1980, 1989, 1999), Computability and Logic (4th ed.), Cambridge University Press, London, ISBN 0-521-20402-X: cf. Chapter 3 Turing machines where they discuss "certain enumerable sets not effectively (mechanically) enumerable".

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.

Cormen T., Leiserson C., Rivest R., and Stein C., Introduction to Algorithms, McGraw Hill,2001

Owen Astrachan Bubble Sort: An Archaeological Algorithmic Analysis, SIGCSE ’03, February 19-23, Reno, Nevada, USA. Copyright 2003 ACM 1-58113-648-X/03/0002.

Cooper, D. Oh My! Modula-2! W.W. Norton, 1990.

Aho A., Hopcroft J., and Ullman J., The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.

Astrachanm O., Bubble Sort: An Archaeological Algorithmic Analysis, Duk University, 2003.

Jehad Alnihoud and Rami Mansi, “An Enhancement of Major Sorting Algorithms,” The International Arab Journal of Information Technology, Vol.7, No. 1, January 2010.

Knuth, D. The Art of Computer Programming: Sorting and Searching, 2 ed., vol. 3. Addison-Wesley, 1998.

Iverson, K. A Programming Language. John Wiley,1962.

http://linux.wku.edu/~lamonml/algor/sort/bubble.html

Downloads

Published

2025-11-11

How to Cite

[1]
N. Harsh N and M. Bhandari, “An Enhancement of Bubble Sorting Algorithm”, Int. J. Comp. Sci. Eng., vol. 5, no. 6, pp. 314–316, Nov. 2025.

Issue

Vol. 5 No. 6 (2017): IJCSE June Edition

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.