Insertion Sort Visualizer

Watch how Insertion Sort builds the sorted array one element at a time by inserting each element into its correct position.

Time: O(n²)

Space: O(1)

Stable: Yes

Adaptive: Yes

Animation Speed: 800ms

Fast (200ms)Slow (2000ms)

Progress: Step 1 of 0Pass 0 of 0

640

341

252

123

224

115

906

Unsorted

Current Key

Insert Position

Comparing

Shifting

Sorted

Click Play to begin the Insertion Sort visualization

Best Case:O(n)

Average Case:O(n²)

Worst Case:O(n²)

Space:O(1)

Stable:Yes

Adaptive:Yes

Question 1 of 3

What makes Insertion Sort 'adaptive'?

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...