Thoroughly rewritten and substantially revised, this book offers a current and comprehensive introduction to the study of computer algorithms. It provides an in-depth treatment of a broad range of algorithms with an emphasis on techniques of design and analysis to help students understand their practical utility. The algorithms are described in English and in a "pseudocode" designed to present each algorithm clearly and succinctly. The text contains over 230 figures illustrating how the algorithms work.

The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, much of the mathematical foundational material has been moved from Part I to an appendix to accommodate additional motivational material at the beginning of the book.

The book is designed to be both versatile and complete. It is intended primarily for use in undergraduate and postgraduate courses in data structures or algorithms. It is equally well suited for self-study by technical professionals because of its extensive coverage of engineering issues in algorithm design.

KEY FEATURES...

Gives analysis of the running times of all algorithms to emphasize efficiency as a design criterion.

Includes over 920 exercises and over 140 problems.

Each chapter ends with a set of "chapter notes" that give historical details and references.

Provides expanded and updated bibliography.

The book has its own Web site: http://mitpress.mit.edu/algorithmsThoroughly rewritten and substantially revised, this book offers a current and comprehensive introduction to the study of computer algorithms. It provides an in-depth treatment of a broad range of algorithms with an emphasis on techniques of design and analysis to help students understand their practical utility. The algorithms are described in English and in a "pseudocode" designed to present each algorithm clearly and succinctly. The text contains over 230 figures illustrating how the algorithms work.

The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, much of the mathematical foundational material has been moved from Part I to an appendix to accommodate additional motivational material at the beginning of the book.

The book is designed to be both versatile and complete. It is intended primarily for use in undergraduate and postgraduate courses in data structures or algorithms. It is equally well suited for self-study by technical professionals because of its extensive coverage of engineering issues in algorithm design.

KEY FEATURES...

Gives analysis of the running times of all algorithms to emphasize efficiency as a design criterion.

Includes over 920 exercises and over 140 problems.

Each chapter ends with a set of "chapter notes" that give historical details and references.

Provides expanded and updated bibliography.

The book has its own Web site: http://mitpress.mit.edu/algorithms

No other version available

No Data