Algorithms and speed
Write code that stays fast as the data grows: searching, sorting, hashing, recursion and a tiny order book.
- Counting stepsHow to say how fast a program is, without a stopwatch.
- Linear searchLook at everything, one item at a time.
- Binary searchFind anything in a sorted list in a handful of steps.
- SortingPutting things in order, the slow way and the right way.
- Dictionaries and hashingLook something up in one step, however much data there is.
- RecursionA function that solves a problem by calling itself.
- Dynamic programmingNever solve the same small problem twice.
- A tiny order bookThe data structure at the heart of an exchange.
- Track quizFive questions. Get four right to finish the track.