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
Design and Analysis of Algorithmsby Herbert Edelsbrunner - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(21859 views)
Elementary Algorithmsby Larry LIU Xinyu - Github
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
(11308 views)
Design and Analysis of Computer Algorithmsby David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(20508 views)
Algorithms for Clustering Databy Anil K. Jain, Richard C. Dubes - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(23165 views)