Introduction to Algorithms By Johns Hopkins University

Johns Hopkins University published well defined Lecture Notes focuses mainly on the design of various algorithms and analysis of their efficiency.  Topics covered includes: the basic definitions of algorithmic complexity, basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications, graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, Online Algorithms, Machine learning Theories, Algorithmic Game Theory, etc.

Read Online/Download