Loyola University Chicago - Computer Science Department
Thomas H. Cormen. Charles E. Leiserson. Ronald L. Rivest. Clifford Stein. Introduction to Algorithms. Third Edition.
This course will focus both on presenting general techniques for designing correct and efficient algorithms, as well as on formal methods for proving the correctness and analyzing the complexity of such algorithms. The course assumes some prior mathematical and algorithmic background and is intended to broaden and deepen that knowledge. Also included will be an introduction to the theory of NP-completeness, whereby certain computation problems can be classified as being difficult in a formal sense.
The goal of this repo is to keep record of the this class and solutions to some of the exercises in the required book. You are welcome to add or suggest other solutions to questions in the book. This repo also contains scripts, homework solutions, Rmarkdown templates and resources part of the class.