Ready to start
Algorithms
Algorithms
Cost, sorting, graphs, greedy, DP. Later headings open after the one before. Analyse and write the standard first-course algorithms — sorting, graphs, greedy, DP — with correctness and cost.
- 6 headings
- Ladder
- Test out a heading you have
Free to start. Sign in with Google or email.
A class on this path
Correctness and cost · First class
Pick where you want to start
Each heading is its own course. Later ones open when you finish — or skip — the one before. A later course does not reteach earlier bands.
Correctness and cost
Start hereArgue a loop invariant on a small algorithm, and give Θ of a nested loop or simple recursion.
Sorting and search
After Correctness and cost — test out to unlockImplement or trace binary search, mergesort, and quicksort, and say which cost you are quoting.
Divide and conquer
After Sorting and search — test out to unlockSet up a recurrence for a divide-and-conquer algorithm and solve it with Master or unfolding.
Graphs: BFS and DFS
After Divide and conquer — test out to unlockRun BFS and DFS by hand, and use them for shortest unweighted path or cycle detection.
Shortest paths
After Graphs: BFS and DFS — test out to unlockRun Dijkstra on a small graph, and know when you need Bellman-Ford instead.
Greedy and DP
After Shortest paths — test out to unlockTell greedy from DP on a classic (activity selection vs knapsack / LCS), and fill a small DP table.
What this is for
- 01
Argue a loop invariant on a small algorithm, and give Θ of a nested loop or simple recursion.
- 02
Implement or trace binary search, mergesort, and quicksort, and say which cost you are quoting.
- 03
Set up a recurrence for a divide-and-conquer algorithm and solve it with Master or unfolding.
Why a path, not a playlist
Cost, sorting, graphs, greedy, DP. Later headings open after the one before.
Each heading is its own course with a tutor. Later headings open when you finish — or test out of — the one before.
After you sign in
- •You land on this map — every heading is already there.
- •Take the open class, or test out of a later heading to unlock it.
- •Each heading is one shared course — same syllabus and first class for everyone. Later classes continue on your copy.