ebook img

Introduction to Algorithms PDF

1947 Pages·2016·16.27 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Introduction to Algorithms

Introduction to Algorithms, Second Edition by Thomas H. ISBN:0262032937 Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein The MIT Press © 2001 (1180 pages) A course in computer algorithms, suitable for use as a field reference for working software developers. Table of Contents Introduction to Algorithms, Second Edition Preface Part I - Foundations The Role of Algorithms in The Role of Algorithms in Chapter 1 - Computing Chapter 2 -Getting Started Chapter 3 -Growth of Functions Chapter 4 -Recurrences Probabilistic Analysis and Chapter 5 - Randomized Algorithms Part II - Sorting and Order Statistics Chapter 6 -Heapsort Chapter 7 -Quicksort Chapter 8 -Sorting in Linear Time Chapter 9 -Medians and Order Statistics Part III - Data Structures Elementary Data Structures Chapter 10 - Chapter 11 -Hash Tables Chapter 12 -Binary Search Trees Chapter 13 -Red-Black Trees Chapter 14 -Augmenting Data Structures Part IV - Advanced Design and Analysis Techniques Chapter 15 -Dynamic Programming Chapter 16 -Greedy Algorithms Chapter 17 -Amortized Analysis Part V - Advanced Data Structures Chapter 18 -B-Trees Chapter 19 -Binomial Heaps Chapter 20 -Fibonacci Heaps Chapter 21 -Data Structures for Disjoint Sets Part VI - Graph Algorithms Chapter 22 -Elementary Graph Algorithms Chapter 23 -Minimum Spanning Trees Chapter 24 -Single-Source Shortest Paths Chapter 25 -All-Pairs Shortest Paths Chapter 26 -Maximum Flow Part VII - Selected Topics Chapter 27 -Sorting Networks Chapter 28 - Matrix Operations Linear Programming Chapter 29 - Chapter 30 -Polynomials and the FFT Chapter 31 -Number-Theoretic Algorithms Chapter 32 -String Matching Chapter 33 -Computational Geometry Chapter 34 -NP-Completeness Chapter 35 -Approximation Algorithms Part VIII - Appendix: Mathematical Background Appendix A -Summations Appendix B -Sets, Etc. Appendix C-Counting and Probability Bibliography Index List of Figures List of Corollaries List of Problems List of Exercises Back Cover There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. 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, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning. About the Authors Thomas H. Cormen is Associate Professor of Computer Thomas H. Cormen is Associate Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Professor of Computer Science and Electrical Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Associate Professor of Industrial Engineering and Operations Research at Columbia University. Introduction to Algorithms, Second Edition Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein The MIT Press Cambridge , Massachusetts London, England McGraw-Hill Book Company Boston Burr Ridge , IL Dubuque , IA Madison , WI New York San Francisco St. Louis Montréal Toronto This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution agreement with the McGraw-Hill Book Company. Ordering Information: North America Text orders should be addressed to the McGraw-Hill Book Company. All other orders should be addressed to The MIT Press. Outside North America All orders should be addressed to The MIT Press or its local distributor. Copyright © 2001 by The Massachusetts Institute of Technology First edition 1990 All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. This book was printed and bound in the United States of America.

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.