Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
- Title Lecture Notes for the Algorithms
- Author(s) Jeff Erickson
- Publisher: University of Illinois, Urbana-Champaign (January 2015)
- eBook HTML and PDF files
- Language: English
- ISBN-10: N/A
- ISBN-13: N/A
- Share This:
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.
Jeff Erickson wrote: These are lecture notes that I wrote for various algorithms classes at the University of Illinois at Urbana-Champaign, which I have taught on average once a year since January 1999. The most recent revision of these notes (or nearly so) is available online at http: //www.cs.illinois.edu/~jeffe/teaching/algorithms/, along with a near-complete archive of all my past homeworks and exams. Whenever I teach an algorithms class, I revise, update, and sometimes cull these notes as the course progresses, so you may find more recent versions on the web page of whatever course I am currently teaching.About the Authors
Jeff Erickson is an Professor of Computer Science at University of Illinois at Urbana-Champaign.