This web page contains a free electronic version of my (soon to be) self-published textbook Algorithms, along with other lecture notes I have written for various theoretical computer science classes at the University of Illinois, Urbana-Champaign since 1998.
Bug reports. After years of trying and failing to manage bug reports by email, I now maintain an issue-tracking page at GitHub. If you find an error in the textbook, in the lecture notes, or in any other materials, please submit a bug report. All other feedback is welcome as well.
Permissions. Anyone is welcome to download, print, use, copy, and/or distribute anything on this page, either electronically or on paper. You do not need to ask my permission, although I would appreciate hearing from you if you find this material useful. If you redistribute any of this material, please include a link back to this web page, either directly or through the mnemomic shortcut http://algorithms.wtf. Specifically:
Please do not ask me for solutions to the exercises. See the course materials page for an explanation.
Context. You can see all this material in context at the websites of my most recent courses: CS 374 (Spring 2018) and CS 473 (Spring 2017). I maintain a complete archive of past homeworks, exams, and lab handouts on a separate page.
Prerequisites. The textbook assumes knowledge of discrete math (especially induction) and basic data structures and algorithms (especially recursion) consistent with the prerequisite courses CS 173 and CS 225 at Illinois. (See the Preface for more details.) For a thorough overview of prerequisite material, I strongly recommend the following resources: