JS Built-ins
← Algorithms1 / 25
Algorithmsbeginner

Bubble Sort

📖 Usage Example
function bubbleSort(arr) {
  const a = [...arr];
  for (let i = 0; i < a.length; i++)
    for (let j = 0; j < a.length - i - 1; j++)
      if (a[j] > a[j+1]) [a[j], a[j+1]] = [a[j+1], a[j]];
  return a;
}
bubbleSort([5, 3, 1]); // [1, 3, 5]

Bubble sort repeatedly swaps adjacent elements that are out of order — O(n^2).

Bubble Sort

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they're in the wrong order. The pass through the list is repeated until the list is sorted.

Time Complexity: O(n²) Space Complexity: O(1)

function bubbleSort(arr: number[]): number[] {
  // Implement bubble sort
  // Return the sorted array
}

bubbleSort([64, 34, 25, 12, 22]) // [12, 22, 25, 34, 64]
💡 Hints (3)
  • • Use a spread operator `[...arr]` to avoid mutating the original array.
  • • Use nested loops: outer loop for passes, inner loop for comparisons.
  • • Swap adjacent elements if they are in wrong order using destructuring: `[a, b] = [b, a]`.