I was pleased with the order of the classes. The earlier classes either built up to the later ones or were more or less mutually exclusive.
Regarding algorithms and discrete math specifically, to me the biggest takeaways from both classes were the problem solving skills and process that Oz taught. There are obviously differences in the nature of the content and exercises between the two classes, but there’s a lot of crossover in what it takes to be successful in both classes. In particular, these are the steps I took to heart:
- State the problem
- Understand the problem
The algorithms content is more “practical” for a non-graphics programmer, but I’d highly recommend both :)