
related topics 
{math, number, function} 
{math, energy, light} 
{specie, animal, plant} 
{rate, high, increase} 
{school, student, university} 
{@card@, make, design} 
{system, computer, user} 

Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. The equally simple insertion sort has better performance than bubble sort, so some have suggested no longer teaching the bubble sort.^{[1]}^{[2]}
Contents
Analysis
Performance
Bubble sort has worstcase and average complexity both О(n^{2}), where n is the number of items being sorted. There exist many sorting algorithms with substantially better worstcase or average complexity of O(n log n). Even other О(n^{2}) sorting algorithms, such as insertion sort, tend to have better performance than bubble sort. Therefore, bubble sort is not a practical sorting algorithm when n is large.
The only significant advantage that bubble sort has over most other implementations, even quicksort, but not insertion sort, is that the ability to detect that the list is sorted is efficiently built into the algorithm. Performance of bubble sort over an alreadysorted list (bestcase) is O(n). By contrast, most other algorithms, even those with better averagecase complexity, perform their entire sorting process on the set and thus are more complex. However, not only does insertion sort have this mechanism too, but it also performs better on a list that is substantially sorted (having a small number of inversions).
Rabbits and turtles
The positions of the elements in bubble sort will play a large part in determining its performance. Large elements at the beginning of the list do not pose a problem, as they are quickly swapped. Small elements towards the end, however, move to the beginning extremely slowly. This has led to these types of elements being named rabbits and turtles, respectively.
Full article ▸


related documents 
Spectral theorem 
Hausdorff space 
Additive category 
Binary tree 
Planar graph 
Binary heap 
Polymorphism in objectoriented programming 
Selforganizing map 
Universal property 
Linear map 
Transcendental number 
Inequality 
Euler–Mascheroni constant 
Horner scheme 
Partial derivative 
Axiom schema of specification 
NPcomplete 
Splay tree 
Projective plane 
Total order 
Convergence of random variables 
Analytic continuation 
Preadditive category 
Field extension 
Octonion 
Embedding 
Array 
Burnside's problem 
Orthogonality 
Uniform convergence 
