Bubble sort: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
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. | ||
The complexity is O(n<sup>2</sup>). | The worst-case and average complexity is O(n<sup>2</sup>). | ||
== Resources == | == Resources == | ||
Revision as of 22:57, 27 May 2018
Bubblesort algorithm is the simplest 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 |