Merge Sort — CodeForge CodeForge — Programming Reference Merge Sort Split until trivial, merge back in order — the divide-and-conquer sort with a guaranteed O(n log n) ceiling and no nasty worst case hiding underneath it. Difficulty: Intermediate Languages: Python · Java · OCaml Read: ~10 min In this article The core idea: divide, sort…

Bubble Sort — CodeCodex Sort Algorithms Bubble Sort The slowest sort most programmers learn first — and exactly because of that, the clearest possible introduction to what “comparing and swapping” even means. Difficulty: Beginner Languages: Python · Java · C Read: ~9 min In this article The core idea: repeated neighbor swaps Why it’s called…

Quicksort — CodeCodex Sort Algorithms Quicksort The divide-and-conquer sort that’s fast on average, fragile in the worst case, and still the default choice behind most general-purpose sort functions in use today. Difficulty: Intermediate Languages: C · Python · Java Read: ~10 min In this article The core idea: partition, then conquer Choosing a pivot —…