Algorithms Part I & II from Princeton | My Review
The instructors are Kevin Wayne and Robert Sedgewick. The former being very active within the course discussion forums and the latter presenting all of the video lectures. Part I & II are separate courses that make up the overall module, with each part spread over ~6 weeks. It's said that this course is closely related to the mandatory algorithms module for Computer Science undergraduates at Princeton.
The standard of teaching material from the video lectures, slides and accompanying website was excellent. The way in which each week's new concept built upon the previous week's was so well structured it was like a well played game of chess.
Each week consisted of ~2 hours of lectures and was accompanied by exercise questions and the main event; a programming assignment to be written in Java. The assignments focused on choosing an appropriate algorithm to solve a large problem based on its characteristics as opposed to just coding a generic implementation of a linked list, binary tree etc. As well as correctly solving the problem presented there were also timing and memory constraints that had to be met in order to achieve 100%. Some took me around ~4 hours to complete and others I lost track of how much time I spent tweaking my solution to meet the benchmarks for 100%.
Read full article from Algorithms Part I & II from Princeton | My Review
