SortingD1Phase 1arrayadjacent-swapintro

Bubble Sort

Baseline sorting visual to introduce comparisons, swaps, and pass optimization.

Easy Explanation

Bubble Sort repeatedly compares neighboring numbers and swaps them until larger values bubble to the end.

Renderer Mode

`Simple` uses abstract, short-form-friendly visuals. `Advanced` keeps the current detailed view.

Arrays + Grid

Visualizer

O(n)Bubble Sort

Deterministic adjacent comparison and swap playback with pass-by-pass sorted region tracking.

Pass

n/a

Comparisons

Swaps

Result

Sorting

Ready

Press Play or Step to start execution.

No values available for visualization.

Parameters

Placeholder

Parameter schema and validation are enabled for Binary Search, BFS, Bidirectional BFS, DFS, Dijkstra, A*, Bubble Sort, Quick Sort, Heap Sort, Topological Sort, Union-Find, Kruskal MST, Prim MST, Bellman-Ford, BST Operations, AVL Rotations, Selection Sort, Counting Sort, Insertion Sort, Merge Sort, Invert Binary Tree, and Trie Operations in this milestone.

Other algorithms keep scaffolded controls until their engines are implemented.

Complexity

Param Aware

Time and space complexity with current-run context derived from normalized params and input size.

Best Time

O(n)

Average Time

O(n^2)

Worst Time

O(n^2)

Space

O(1)

Current Run

O(n) on this input (early exit)

n = 0

optimizeEarlyExit = true

Input already sorted: true

Theoretical comparisons: best 0, worst 0

Observed comparisons: pending

Complexity updates when params regenerate the deterministic run.

Bubble Sort Implementation

Pseudocode + TypeScript

Reference implementation examples are intentionally abstracted from the playback engine so learners can map concepts to code.

pseudocode

function bubbleSort(values):
  n <- length(values)

  for pass from 0 to n - 2:
    swapped <- false

    for i from 0 to n - pass - 2:
      if values[i] > values[i + 1]:
        swap values[i], values[i + 1]
        swapped <- true

    if swapped == false:
      break

  return values

1.00xNo Run