ALGORITHMUS-LESENOTIZ

Quicksort

Quicksort picks a pivot, partitions values around it, then recursively sorts the partitions.

TYPAlgorithmusKATEGORIESortingTIEFEEinsteigerTYPISCHE KOMPLEXITÄTavg O(n log n), worst O(n²)

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

Quicksort picks a pivot, partitions values around it, then recursively sorts the partitions.

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen Jargon

Average time is O(n log n), but poor pivot choices can lead to O(n²).

In-place variants need little extra array memory, though recursion still uses stack space.

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

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

function quickSort(a) {
  if (a.length <= 1) return a;
  const pivot = a[Math.floor(a.length / 2)];
  const left = a.filter(x => x < pivot);
  const equal = a.filter(x => x === pivot);
  const right = a.filter(x => x > pivot);
  return [...quickSort(left), ...equal, ...quickSort(right)];
}

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

avg O(n log n), worst 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

Discuss pivot strategy and partition scheme. Saying only 'O(n log n)' misses the important worst-case trade-off.

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

SCHNELLER INTERVIEW-CHECK

What problem does Quicksort solve?

Quicksort picks a pivot, partitions values around it, then recursively sorts the partitions.

Was sollte ich zur Komplexität erwähnen?

Its typical cost here is avg O(n log n), worst 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 quickSort(a) { if (a.length <= 1) return a; const pivot = a[Math.floor(a.length / 2)]; const left = a.filter(x => x < pivot); const equal = a.filter(x => x === pivot); const right = a.filter(x => x > pivot); return [...quickSort(left), ...equal, ...quickSort(right)]; }