Overview of the Study on Bubble Sort Algorithm

Dong Fuguo -, Lan Wu, Yuan Da · International Journal of Advancements in Computing Technology · 2011

Bubble sort algorithm and its variants are discussed in detail. Bubble sort algorithm is the slowest one in application; improved bubble sort algorithm is superior to it because of the introduction of flag variant and the forward movement of end index; improved bubble sort algorithm moves the end index more quickly; bidirectional bubble sort algorithm quickly moves the end index forwards and the start index backwards at the same time. In all these algorithms, bidirectional bubble sort algorithm is especially suitable to those sequence parts items of which are already in expected order. Bidirectional bubble sort algorithm is of great significance and has the highest efficiency.

Read the paper · More papers on PaperTik