Course content

91 lessons

What makes an algorithm fast

0/11

Putting things in order

0/14

Selection sort: fewest moves, not fewest looks

The invariant: why insertion sort always works

The quadratic wall: 1,000 orders on Eid night

Merge sort: split, sort, then merge

Quicksort: the pivot decides

Who arrived first? Stable sorting

No comparison sort beats n log n

Beating n log n: counting sort

Nabila's sorting round

Mission: the Eid rush

10m

Exam practice: sorting

10m

Sorting: quick revision

Finding a value: scan, halve, or sort first

0/8

Where the data lives: arrays, lists, stacks and queues

0/10

Hashing: turning a key into an address

0/10

Trees, and why their shape decides everything

0/10

Heaps: the most urgent parcel first

0/11

Graphs: when anything can connect to anything

0/11

Dynamic programming: never solve the same thing twice

0/6

Putting things in orderLesson 2 of 14Free preview

Insertion sort: slide each order into place

A nearly sorted list takes 9 comparisons and 2 shifts. Each shift fixes one inversion.