ABSTRACT
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 and ample of research is still going on to
make an extensive analysis of the existing algorithms to reduce
their time complexity up to the extent possible. Research is also
going on for finding the algorithms which are fast enough than
the existing ones.
In this paper the authors have tried to improve upon the Bubble
Sort technique by implementing the algorithm using a new
approach of implementation .An extensive analysis has been
done by the authors on the new approach and the approach has
been compared with the traditional method of ―Bubble Sort‖
along with its popular variation ―Bi-Directional Sort‖.
Interesting observations have been obtained on comparing this
new approach with the existing approaches of Bubble Sort. The
approach was tested for Average Case analysis, Best Case
analysis and Worst case analysis. It has been observed that the
new approach has given wonderful results on Average Case
and Worst Case analysis. Hence the authors have reached to the
conclusion through the experimental observations that the new
approach as suggested in this paper is better than the traditional
Bubble Sort and its Bi-Directional variation