ALGORITHM READING NOTE

Insertion Sort

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

TYPEAlgorithmCATEGORYSortingDEPTHBeginnerTYPICAL COMPLEXITYO(n²)

SHORT INTERVIEW ANSWER

Start with this mental model

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

SIMPLE EXPLANATION

How it works, without unnecessary jargon

It behaves like sorting playing cards in your hand.

It is O(n²) generally, but performs well on small or nearly sorted input and is stable.

EXECUTION

Read the algorithm as a sequence of decisions

Understand what one pass/partition/merge guarantees.

Track which region is already finalized.

Reason about comparisons, swaps/moves and extra memory.

A small example to keep in mind

Read a tiny input by hand and write down the state after every important operation. For Insertion Sort, the goal is to make the invariant visible rather than to memorize code.

READABLE JAVASCRIPT IMPLEMENTATIONJavaScript

function insertionSort(input) {
  const a = [...input];
  for (let i = 1; i < a.length; i++) {
    const value = a[i];
    let j = i - 1;
    while (j >= 0 && a[j] > value) {
      a[j + 1] = a[j];
      j--;
    }
    a[j + 1] = value;
  }
  return a;
}

How to read this code

Do not memorize the syntax. Follow the state that changes on each line and connect it to the invariant described above.

COMPLEXITY

O(n²)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

WHEN TO USE IT

Good fit

Choose based on input size, order, key range, stability and memory limits.

COMMON MISTAKES

What usually goes wrong

Comparing only average Big-O.
Forgetting stability, in-place behavior, recursion depth or key-domain assumptions.

HOW TO EXPLAIN IT IN AN INTERVIEW

A professional answer shape

Mention adaptive behavior on nearly sorted data and why insertion sort is often used for small partitions inside hybrid sort implementations.

Problem→Core idea→Invariant / state→Big-O→Trade-off

QUICK INTERVIEW CHECK

What problem does Insertion Sort solve?

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

What should I mention about complexity?

Its typical cost here is O(n²), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

What is the most common mistake?

Comparing only average Big-O.

Continue readingStable sortingIn-place sortingDivide and conquer

function insertionSort(input) { const a = [...input]; for (let i = 1; i < a.length; i++) { const value = a[i]; let j = i - 1; while (j >= 0 && a[j] > value) { a[j + 1] = a[j]; j--; } a[j + 1] = value; } return a; }