Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. This lecture notes uniquely combines rigor and comprehensiveness.
It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
Title Lecture Notes for the Algorithms
Author(s) Jeff Erickson
Publisher: Jeff Erickson (January, 2011)
Language: English
eBook: http://compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/
No comments:
Post a Comment