Minimizing Execution Time of Bubble Sort Algorithm

It has been observed that the new approach has given efficient results in terms of execution time and the new algorithm given in this paper is better than the traditional Bubble Sort. Sorting is an important data structure which finds its place in many real life applications. A number of sorting algorithms are in existence till date. In this paper the we have tried to improve upon execution time of the Bubble Sort algorithm by implementing the algorithm using a new algorithm .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 algorithm 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.

How many passes are required in bubble sort? - Quora

Sorting Algorithms Explained with Examples in JavaScript, Python, Java, and C++

What is the implementation bubble sort algorithm using function (argument passed and no return value)? - Quora

An Improved Bubble Sort Method - Marking Bubble Sort

Javascript Algorithms: Bubble Sort, by Kevin Lai

Sorting (Bubble, Selection, Insertion, Merge, Quick, Counting, Radix) - VisuAlgo

Bubble Sort Algorithm - Scaler Topics

Bubble sort: Analyzing the Sortinoratio in the Simplest Sorting Algorithm - FasterCapital

Bubble Sort Algorithm - Scaler Topics

Performance of Sorting algorithms

Bubble Sort Algorithm - Scaler Topics

PDF) Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language WARSE The World Academy of Research in Science and Engineering and Dr. Shah Muhammad Butt