This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency.
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal
Linear Programming (Modern Birkhäuser Classics)
To this reviewer's knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method via the Ellipsoid algorithm to Karmarkar's algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory.
Algorithms by Robert Sedgewick This book presents an interesting challenge. It talks about algorithms
yet it does not present algorithms, nor does it define algorithm as
anything more than a "problem-solving method suitable for
implementation as computer programs[p.4]." Instead, it exhibits
programs which are the implementations of algorithms and discusses them
as if the algorithm is apparent. The reader is left with the challenge
of learning to discriminate between what is essential about an
algorithm, and how to preserve that in an implementation, versus what
is inessential to the algorithm and introduced on account of the
implementation and the use of particular programming tools.
