Bubble Sort

Size
Speed

Description

This algorithm works by iterating through each pair in the array and swapping them if they are in the wrong order.

The outer loop puts the current largest element into it's correct place at the end of the array.

The inner loop achieves this by doing the swapping.

Since the previous largest element will be in it's place, the inner loop only needs to iterate up to this.

Complexity

Time
  • Best Case
  • Worst Case
  • Average Case
  • O(n^2)
  • O(n^2)
  • O(n^2)
Space
  • O(1)

Implementation

function bubbleSort(arr) {

  for (let i = arr.length - 1; i >= 0; i--) {

    for (let j = 0; j < i; j++) {
      if (arr[j] > arr[j + 1]) {
        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
      }
    }

  }
  return arr;

}