194
322
204
172
126
236
20
190
158
40
40
342
218
68
180
192
88
24
110
192

Bubble Sort Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.The pass through the list is repeated until the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems
Complexity
  • Worst-case time complexity : O(n2)
  • Average time complexity : O(n2)
  • Best-case time complexity : O(n)
  • Worst-case space complexity : O(1)