Bubble sort: Difference between revisions
Jump to navigation
Jump to search
Created page with "== Resources == https://en.wikipedia.org/wiki/Bubble_sort" |
No edit summary |
||
| Line 1: | Line 1: | ||
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 complexity is O(n2). | |||
== Resources == | == Resources == | ||
https://en.wikipedia.org/wiki/Bubble_sort | {| class="wikitable" | ||
! | |||
|- | |||
|https://en.wikipedia.org/wiki/Bubble_sort | |||
|} | |||
Revision as of 22:55, 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 complexity is O(n2).
Resources
| https://en.wikipedia.org/wiki/Bubble_sort |