Skip to content
C Codeloom

Topics / Sorting

📊

Sorting

Bubble, insertion, merge, quick, heap — and the engineering judgement to just call sort().

Why learn Sorting?

  • Many problems become trivial after a sort step.

  • Merge sort and quick sort showcase divide-and-conquer brilliantly.

  • Counting sort and bucket sort appear in unexpected places.

What you can build with Sorting

Custom comparators and stable sorts Pre-processing step for interval and array problems External sorting for large datasets

Sorting tutorials

1 article

Hand-written tutorials, ordered as a recommended learning path.

  1. 01 Sorting Overview A tour of the five sorting algorithms every programmer should know — their ideas, Big-O time and space, stability, and Python implementations, plus when to just use sort().