Bubble sort: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Bubble sort is the simplest exchange sorting algorithm. | |||
Each element of the array is compared (and swapped if bigger) with every other element of the array. | Each element of the array is compared (and swapped if bigger) with every other element of the array. | ||
Revision as of 04:51, 28 May 2018
Bubble sort is the simplest exchange sorting algorithm.
Each element of the array is compared (and swapped if bigger) with every other element of the array.
The worst-case and average complexity is O(n2).
This algorithm should only be used on almost sorted array (that implies few permutations).
Resources
| https://en.wikipedia.org/wiki/Bubble_sort |