Sorting Visualizer

Default

Comparing

Swapping

Pivot

Sorted

Debugger · v1.0

LIVE

1function insertionSort(array) {

2 const n = array.length;

3 for (let i = 1; i < n; i++) {

4 let key = array[i];

5 let j = i - 1;

6 while (j >= 0 && array[j] > key) {

7 array[j + 1] = array[j];

8 j--;

9 }

10 array[j + 1] = key;

11 }

12}

Debugger · v1.0

LIVE

1function insertionSort(array) {

2 const n = array.length;

3 for (let i = 1; i < n; i++) {

4 let key = array[i];

5 let j = i - 1;

6 while (j >= 0 && array[j] > key) {

7 array[j + 1] = array[j];

8 j--;

9 }

10 array[j + 1] = key;

11 }

12}

State Inspector

?

No variables in scope.

Size:30

1x

Insertion Sort

Step 1 of 6

Insertion Sort builds the final sorted array one item at a time, inserting each element into its correct position.

Start with First Element

Assume the first element is already sorted.