Searching & Sorting

14 lessons

1
Linear Search
Check every item one by one. The simplest search there is, and sometimes the only one that works.
5 min read
2
Binary Search
Halve the search space every step to find an element in logarithmic time, and recognise the problems that hide a binary search inside them.
9 min read
3
Jump Search
Skip ahead in fixed steps, then walk back. A middle ground between linear and binary search.
6 min read
4
Interpolation Search
Guess where the value probably is instead of always splitting down the middle.
6 min read
5
Exponential & Fibonacci Search
Two ways to find a range first, then search inside it — useful when the array is huge or seeking is expensive.
7 min read
6
Bubble Sort
Repeatedly swap neighbours that are out of order until nothing moves.
5 min read
7
Selection Sort
Find the smallest item, put it first, repeat. Minimal swaps, but never fast.
5 min read
8
Insertion Sort
Build a sorted section one item at a time, exactly how you sort a hand of cards.
6 min read
9
Merge Sort
Split in half, sort each half, then zip them together. Guaranteed n log n, every time.
8 min read
10
Quick Sort
Pick a pivot, push smaller left and bigger right, then repeat on each side.
8 min read
11
Heap Sort
Turn the array into a heap, then repeatedly pull out the largest. O(n log n) guaranteed, with no extra memory.
7 min read
12
Counting Sort
Tally how many times each value appears, then rebuild the array. No comparisons at all.
6 min read
13
Radix Sort
Sort by the last digit, then the next, and so on. The order appears without a single comparison.
7 min read
14
Searching & Sorting Cheat Sheet
Every algorithm side by side, with a decision guide for picking the right one under pressure.
6 min read

Searching & Sorting Quiz24 questions · pass mark 60%