ALGORITHMUS-LESENOTIZ

Merge Sort

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

TYPAlgorithmusKATEGORIESortingTIEFEEinsteigerTYPISCHE KOMPLEXITÄTO(n log n)

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen Jargon

The merge step is linear because each side is already sorted.

There are log n levels of splitting, so total time is O(n log n). Standard array implementations use O(n) extra memory.

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 Merge Sort, the goal is to make the invariant visible rather than to memorize code.

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

function mergeSort(a) {
  if (a.length <= 1) return a;
  const mid = Math.floor(a.length / 2);
  return merge(mergeSort(a.slice(0, mid)), mergeSort(a.slice(mid)));
}

function merge(left, right) {
  const out = [];
  let i = 0, j = 0;
  while (i < left.length && j < right.length) {
    out.push(left[i] <= right[j] ? left[i++] : right[j++]);
  }
  return out.concat(left.slice(i), right.slice(j));
}

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 log 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

Highlight predictable O(n log n), stability, and the extra-memory trade-off. It is also natural for linked lists and external sorting.

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

SCHNELLER INTERVIEW-CHECK

What problem does Merge Sort solve?

Merge sort uses divide and conquer: split the array until pieces are trivial, then merge sorted pieces back together.

Was sollte ich zur Komplexität erwähnen?

Its typical cost here is O(n log 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 mergeSort(a) { if (a.length <= 1) return a; const mid = Math.floor(a.length / 2); return merge(mergeSort(a.slice(0, mid)), mergeSort(a.slice(mid))); } function merge(left, right) { const out = []; let i = 0, j = 0; while (i < left.length && j < right.length) { out.push(left[i] <= right[j] ? left[i++] : right[j++]); } return out.concat(left.slice(i), right.slice(j)); }