This course is an introduction to the design and analysis of algorithms, including sorting, graph algorithms, searching, string algorithms, and data compression. The course concentrates on the algorithms’ developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications.

Prerequisites

This course website includes links to course content, including lecture slides and programming from Robert Sedgewick and Kevin Wayne of Princeton (Only for learning), assignments, and discussions.