Course content

91 lessons

What makes an algorithm fast

0/11

Putting things in order

0/14

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

Depth first: ride to the end, then back up

Topological sort: a safe order for the warehouse

When roads cost minutes: Dijkstra's algorithm

When Dijkstra is wrong: the toll refund

Minimum spanning tree: fibre for every hub

Nabila's quick-fire round

Mission: route Sumon's day

10m

Exam practice: graphs

10m

Graphs: quick revision

Dynamic programming: never solve the same thing twice

0/6

Graphs: when anything can connect to anythingLesson 2 of 11Free preview

Breadth first: the fewest hand-overs

A queue explores Dhaka ring by ring, so Motijheel is found in 2 hops from Mirpur-10. BFS costs O(V + E).