ALGORITHMUS-LESENOTIZ

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.

TYPAlgorithmusKATEGORIESortingTIEFEEinsteigerTYPISCHE KOMPLEXITÄTO(n²)

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

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.

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen 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.

AUSFÜHRUNG

Lies den Algorithmus als Folge von Entscheidungen

Understand what one pass/partition/merge guarantees.

Track which region is already finalized.

Reason about comparisons, swaps/moves and extra memory.

Ein kleines Beispiel als Orientierung

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.

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

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;
}

So liest du diesen Code

Lerne die Syntax nicht auswendig. Folge dem Zustand, der sich in jeder Zeile ändert, und verbinde ihn mit der oben beschriebenen Invariante.

KOMPLEXITÄT

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.

WANN EINSETZEN

Gut geeignet

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

HÄUFIGE FEHLER

Was typischerweise schiefgeht

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

SO ERKLÄRST DU ES IM INTERVIEW

Struktur einer professionellen Antwort

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

Problem→Kernidee→Invariante / Zustand→Big-O→Trade-off

SCHNELLER 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.

Was sollte ich zur Komplexität erwähnen?

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

Was ist der häufigste Fehler?

Comparing only average Big-O.

WeiterlesenStable 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; }