ALGORITHMUS-LESENOTIZ

Bubble Sort

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

TYPAlgorithmusKATEGORIESortingTIEFEEinsteigerTYPISCHE KOMPLEXITÄTO(n²)

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen Jargon

After one full pass, the largest unsorted value is in its final position.

With an early-exit flag, an already sorted array can finish in O(n).

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

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

function bubbleSort(input) {
  const a = [...input];
  for (let end = a.length - 1; end > 0; end--) {
    let swapped = false;
    for (let i = 0; i < end; i++) {
      if (a[i] > a[i + 1]) {
        [a[i], a[i + 1]] = [a[i + 1], a[i]];
        swapped = true;
      }
    }
    if (!swapped) break;
  }
  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

Forgetting the shrinking end boundary.
Using it for large real workloads where O(n²) is too expensive.

SO ERKLÄRST DU ES IM INTERVIEW

Struktur einer professionellen Antwort

Use it mainly to demonstrate sorting fundamentals, stability and best/average/worst-case reasoning rather than as a production default.

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

SCHNELLER INTERVIEW-CHECK

What problem does Bubble Sort solve?

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

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?

Forgetting the shrinking end boundary.

WeiterlesenStable sortingIn-place sortingDivide and conquer

function bubbleSort(input) { const a = [...input]; for (let end = a.length - 1; end > 0; end--) { let swapped = false; for (let i = 0; i < end; i++) { if (a[i] > a[i + 1]) { [a[i], a[i + 1]] = [a[i + 1], a[i]]; swapped = true; } } if (!swapped) break; } return a; }