Open Access   Article Go Back

An Enhancement of Bubble Sorting Algorithm

Harsh N. Nankani1 , Mukesh Bhandari2

  1. Vadodara Institute of Engineering, Gujarat Technological University, Vadodara, India.
  2. Vadodara Institute of Engineering, Gujarat Technological University, Vadodara, India.

Correspondence should be addressed to: harshnankani196@gmail.com.

Section:Review Paper, Product Type: Journal Paper
Volume-5 , Issue-6 , Page no. 314-316, Jun-2017

Online published on Jun 30, 2017

Copyright © Harsh N. Nankani, Mukesh Bhandari . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Harsh N. Nankani, Mukesh Bhandari, “An Enhancement of Bubble Sorting Algorithm,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.6, pp.314-316, 2017.

MLA Style Citation: Harsh N. Nankani, Mukesh Bhandari "An Enhancement of Bubble Sorting Algorithm." International Journal of Computer Sciences and Engineering 5.6 (2017): 314-316.

APA Style Citation: Harsh N. Nankani, Mukesh Bhandari, (2017). An Enhancement of Bubble Sorting Algorithm. International Journal of Computer Sciences and Engineering, 5(6), 314-316.

BibTex Style Citation:
@article{Nankani_2017,
author = {Harsh N. Nankani, Mukesh Bhandari},
title = {An Enhancement of Bubble Sorting Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2017},
volume = {5},
Issue = {6},
month = {6},
year = {2017},
issn = {2347-2693},
pages = {314-316},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1347},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1347
TI - An Enhancement of Bubble Sorting Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Harsh N. Nankani, Mukesh Bhandari
PY - 2017
DA - 2017/06/30
PB - IJCSE, Indore, INDIA
SP - 314-316
IS - 6
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
502 418 downloads 560 downloads
  
  
           

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.

Key-Words / Index Term

Sorting, Bubble sort

References

[1] Kruse R., and Ryba A., Data Structures and Program Design in C++, Prentice Hall, 1999.
[2]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".
[3] 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.
[4] Cormen T., Leiserson C., Rivest R., and Stein C., Introduction to Algorithms, McGraw Hill,2001
[5] 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.
[6] Cooper, D. Oh My! Modula-2! W.W. Norton, 1990.
[7] Aho A., Hopcroft J., and Ullman J., The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
[8] Astrachanm O., Bubble Sort: An Archaeological Algorithmic Analysis, Duk University, 2003.
[9] Jehad Alnihoud and Rami Mansi, “An Enhancement of Major Sorting Algorithms,” The International Arab Journal of Information Technology, Vol.7, No. 1, January 2010.
[10] Knuth, D. The Art of Computer Programming: Sorting and Searching, 2 ed., vol. 3. Addison-Wesley, 1998.
[11] Iverson, K. A Programming Language. John Wiley,1962.
[12] http://linux.wku.edu/~lamonml/algor/sort/bubble.html