Algorithms, Part I

Algorithms, Part I is the first half of Robert Sedgewick and Kevin Wayne's Princeton course on the algorithms and data structures every serious programmer should know, with emphasis on applications and on scientific performance analysis of Java implementations. Its thirteen modules cover union-find, analysis of algorithms, stacks and queues, elementary sorts, mergesort, quicksort, priority queues, elementary symbol tables, balanced search trees, geometric applications of binary search trees, hash tables and symbol-table applications. Work consists of weekly exercises, weekly programming assignments, weekly interview questions and a final exam. Coursera labels the course intermediate level with a flexible schedule and estimates five weeks at ten hours a week.

The course page states that all of its features are available for free and that, under Princeton University policy, no certificates, credentials or reports are awarded. The textbook Algorithms, Fourth Edition is optional. Part II, on graph and string algorithms, is a separate free course.