SortingEasy

Insertion Sort

Builds the final sorted array one item at a time by repeatedly shifting larger elements and inserting the key.

Time O(n²) Space O(1)

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

MicrosoftGoldman Sachs

Reference implementation (Python)

def insertion_sort(arr):
    for i in range(1, len(arr)):
        key = arr[i]
        j = i - 1
        while j >= 0 and key < arr[j]:
            arr[j + 1] = arr[j]
            j -= 1
        arr[j + 1] = key
    return arr

Embed this visualization

Drop a live, looping Insertion Sort canvas into a blog post or course page.

<iframe src="/embed/insertion-sort" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>

Frequently asked

What is the time and space complexity of Insertion Sort?

Insertion Sort runs in O(n²) time and O(1) auxiliary space.

Is the Insertion Sort visualizer free?

The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.

Which companies ask Insertion Sort in interviews?

Insertion Sort shows up in interviews at Microsoft, Goldman Sachs.

How does the 3D visualization of Insertion Sort work?

Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.

More Sorting