Bubble Sort and Its Improved Methods

Bubble sorting is a simple sorting algorithm, and it is also a stable sorting algorithm. The principle is to repeatedly scan the elements to be sorted and compare each pair of adjacent elements, swapping when the pair of elements is not in the correct order. This process is repeated until no two adjacent elements can be exchanged, indicating that the sorting is complete. This paper describes the basic bubble sort and three improvement methods of bubble sort[1].