User Tools

Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
bubble_sort [2013/05/19 02:06]
eeklund
bubble_sort [2015/02/02 08:28] (current)
Line 2: Line 2:
 Bubble sort is a simple sorting algorithm that sorts by repeatedly swapping out of order pairs until Bubble sort is a simple sorting algorithm that sorts by repeatedly swapping out of order pairs until
 there are no more pairs that need swapping. ​ It is very seldom a good choice for production use; it is almost there are no more pairs that need swapping. ​ It is very seldom a good choice for production use; it is almost
-always better to use an insertion sort for small data or a more complicated sort.  A related sort is the [[Cocktail sort]],+always better to use an insertion sort for small data or a more complicated sort. A related sort is the [[Cocktail sort]],
 which can be considered an optimized bubble sort.  Cocktail sort is also seldom suitable for production use. which can be considered an optimized bubble sort.  Cocktail sort is also seldom suitable for production use.
  
 +===== Properties =====
 +  * Stable
 +  * $O(1)$ space
 +  * $O(n^2)$ comparisons
 +  * Adaptive, $O(n)$ when nearly sorted
  
 [algorithm bubble sort] [algorithm bubble sort]
bubble_sort.1368954386.txt.gz ยท Last modified: 2015/02/02 08:24 (external edit)