Textbook
The textbook for the course is Algorithms by Jeff Erickson (1st edition, 2019).
Recommended books also include:
- Introduction to Algorithms, by T.H. Cormen, C.E. Leiserson and R.L. Rivest (3rd edition, MIT Press,
2009 or 4th edition, MIT Press 2022). This is an outstanding book on data structures and algorithms,
well worth having. It is at the same time a very big book, covering substantial more material than the
one addressed in this course. Excerpts may be made available to you now and then in the course.
- Foundations of Algorithms, by R. Neapolitan, (5th edition, Jones & Bartlett Learning, 2015). This is
a more accessible textbook on algorithms that covers most (if not all) the material considered in the
course. Again excerpts may be made available to you when needed.
The two recommended textbooks are available in the Library. The call numbers are QA 76.6 .C662 2022 for
Cormen (4th edition) and QA 9.58 .N43 2015 for Neapolitan. I reserve the right to place them on reserve at any time
during the term.