Computer Science & Algorithms
Section 1
Core Idea
Sorting puts a sequence in order (e.g. by value or key). Different algorithms trade off time, space, and stability. Comparison-based sorts (e.g. merge sort, quicksort) use only comparisons; lower bound Ω(n log n) for general comparison sort. Merge sort: divide the list, sort each half, merge — O(n log n), stable, good when random access is costly. Quicksort: pick a pivot, partition, recurse — O(n log n) average, in-place, fast in practice. Bubble sort: repeatedly swap adjacent out-of-order pairs — O(n²), simple but slow. Bucket/count sorts use the structure of keys for linear time when keys are bounded. Choice depends on data size, memory, and whether stability matters.
Free playbook
Get The Business Model Playbook
58 business models, one visual page each: how the money flows, the metrics that matter, and who runs it. Free when you join the Faster Than Normal email.
Free. No spam. Unsubscribe anytime.
Section 2
How to See It
Understanding & Analyzing
You're seeing Sorting Algorithms when data is ordered for search, display, or aggregation — leaderboards, timelines, search results by relevance. The choice of sort (and whether to sort at all) affects latency and cost.
Deciding & Judging
You're seeing Sorting Algorithms when a backlog or queue is prioritised by a key (due date, value, score) — effectively sorting items to decide order of work. The "algorithm" may be explicit (e.g. sort then take top k) or implicit in the process.
Section 3
How to Use It
Order matters for search (binary search needs sorted input), display (rankings, feeds), and prioritisation (what to do first). For small n or one-off lists, simple sorts are fine. For large or repeated sorts, use O(n log n) methods (merge, quicksort) or linear-time sorts when keys have structure. Avoid O(n²) on large inputs.
Decision filter
"Do we need a total order, and at what scale? If we only need the top k, partial sort or a heap may beat full sort. If we're sorting repeatedly, invest in the right algorithm and data structure."
As a founder
Prioritisation is sorting: by impact, urgency, or score. Choose the key (what we're sorting by), then apply the discipline — actually order the list and work in that order. For large backlogs, use efficient ordering (e.g. heap for "top k") rather than ad hoc picking. Sorting algorithms are the reference for how to do ordering well at scale.
Section 5
Founders & Leaders
Jensen HuangCo-founder & CEO, NVIDIA
Huang built NVIDIA around parallel compute; GPUs excel at parallel sort and other bulk operations. Sorting at scale — and choosing the right primitive (sort vs partial sort vs heap) — is central to data pipelines and ML. Founders can take the lesson: ordering and prioritisation are algorithmic; pick the right "sort" for the problem (full order vs top-k vs streaming) and scale it.
Section 7
Connected Models
Reinforces
Binary Search
Binary search assumes sorted input. Sorting is the preprocessing step that makes fast search possible. Together: sort once, then search in O(log n) per query.
Tension
Divide and Conquer
Merge sort is divide and conquer: split, sort halves, merge. Quicksort divides by pivot. The tension: same paradigm, different split strategies and stability; choose by constraints (memory, stability, average case).
Leads-to
Algorithms
Sorting is a canonical algorithmic problem — well-defined, many solutions, clear complexity bounds. Understanding sorting teaches algorithm design, recurrence analysis, and the tradeoffs between time, space, and stability.
Section 8
One Key Quote
— Donald Knuth, The Art of Computer Programming"Sorting is the most fundamental operation in the study of algorithms." It exposes structure, enables search, and illustrates tradeoffs that recur across computer science.
Section 11
Summary & Further Reading
Sorting puts sequences in order. Comparison-based sorts have Ω(n log n) lower bound; merge sort and quicksort achieve O(n log n). Choose by scale, memory, and stability. Use sorting (or partial sort) for prioritisation, search prep, and ordered display.
01
Book
Authoritative treatment of sorting: merge sort, quicksort, heapsort, and lower bounds.
02
Book
Definitive discussion of sorting and searching; analysis and history.
03
Book
Practical treatment with code; quicksort, mergesort, and applications.