AlgoViz: Interactive Algorithm Visualization Tool

Bubble Sort

Category: Sorting | Time: O(n^2) | Space: O(1)

Input Data

Visualization

Visual representation of the data structure

Enter an algorithm and input to start visualization.

About Bubble Sort

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.

Code Editor

The code is for reference. Editing it won't affect the visualization.

function bubbleSort(arr) {
  let n = arr.length;
  for (let i = 0; i < n - 1; i++) {
    for (let j = 0; j < n - i - 1; j++) {
      if (arr[j] > arr[j + 1]) {
        let temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;
      }
    }
  }
  return arr;
}

Frequently Asked Questions

About Bubble Sort

What is Bubble Sort?

What is the time complexity of Bubble Sort?

Is Bubble Sort a stable sorting algorithm?

When is it practical to use Bubble Sort?

What is the space complexity of Bubble Sort?

How can you optimize Bubble Sort?

Is Bubble Sort an adaptive sorting algorithm?

What is the difference between Bubble Sort and Selection Sort?

Can Bubble Sort be implemented recursively?

Why is it called 'Bubble' Sort?

Where can I learn more?