Algorithms
by Jeff Erickson
Publisher: University of Illinois at Urbana-Champaign 2009
Number of pages: 765
Description:
This course packet includes lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois at Urbana-Champaign. For the most part, these notes assume that the reader has mastered the material covered in the first two years of a typical undergraduate computer science curriculum.
Download or read it online for free here:
Download link
(20MB, PDF)
Similar books
Randomized Algorithmsby Wolfgang Merkle - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(9746 views)
Algorithms and Data Structuresby Niklaus Wirth - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
(16607 views)
Average Case Analysis of Algorithms on Sequencesby Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(10672 views)
Essentials of Metaheuristicsby Sean Luke
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.
(9688 views)