CPT204 / Week 08
Developing efficient algorithms
The preceding two weeks introduced classic data structures such as lists, stacks, queues, priority queues, sets, and maps, and used them to solve problems. This week shifts to common algorithmic techniques including dynamic programming, divide-and-conquer, and backtracking for developing efficient algorithms.