Algorithms

Sorting

Searching

Graph

Dynamic Programming

Backtracking

Pathfinding

Trees

String

Math

Bit Manipulation

Two Pointers

Greedy

Geometry

Bubble Sort

Swap adjacent out-of-order pairs until sorted.

Custom input

Run the code to visualize.

Step 0 / 0

0.5×

Code (JavaScript)

// Bubble Sort — repeatedly swap adjacent out-of-order pairs.
const array = new Array1DTracer('Array');
const log = new LogTracer('Console');
const D = [5, 2, 9, 1, 7, 3, 8, 4, 6];
array.set(D);
Tracer.delay();

for (let i = 0; i < D.length - 1; i++) {
  let swapped = false;
  for (let j = 0; j < D.length - 1 - i; j++) {
    array.select(j, j + 1);
    Tracer.delay();
    if (D[j] > D[j + 1]) {
      const t = D[j]; D[j] = D[j + 1]; D[j + 1] = t;
      log.println('swap D[' + j + '] ↔ D[' + (j + 1) + ']');
      array.set(D);
      array.patch(j); array.patch(j + 1);
      Tracer.delay();
      array.depatch(j); array.depatch(j + 1);
      swapped = true;
    }
    array.deselect(j, j + 1);
  }
  if (!swapped) break;
}
log.println('Sorted!');
Tracer.delay();

Edit the code and press Run. Tracers: Array1DTracer, ChartTracer, GraphTracer, Array2DTracer, GridTracer, LogTracer — call Tracer.delay() to add an animation step, then Share to copy a link with your code. Runs safely in your browser.