Bubble sort: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Bubblesort | Bubblesort 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 01:34, 28 May 2018
Bubblesort 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).
Resources
| https://en.wikipedia.org/wiki/Bubble_sort |