Algorithms, Part II | Robert sedgewick Algorithms Part 2 |

Robert Sedgewick, Kevin Wayne

Princeton University


Start: November 2012 (6 weeks)
Workload: 6-10 hours per week
Computer Science: Theory
Computer Science: Programming & Software Engineering


This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations.


Part II covers graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.

Via Dr. Stefan Gruenwald