About this title: This title 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. This second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as ...
read more
Note: This is a general synopsis. Each listing is described below.
Edition: 2nd ed.
Binding: Hardcover
Publisher: Mit Press
Date Published: 2001
ISBN-13:9780262032933ISBN:0262032937
Description: New. No dust jacket as issued. 2nd edition. Nice new hardcover textbook! Pages are clean and unmarked. Binding is tight. Remainder mark on bottom edge. Securely packed. Sewn binding. Cloth over boards. 1202 p. Audience: General/trade. read more
Edition: 2nd ed.
Binding: Hardcover
Publisher: MIT Press, Cambridge, MA USA
Date Published: 2001
ISBN-13:9780262032933ISBN:0262032937
Description: Very good. No dust jacket as issued. Clean and complete with unmarked pages; strong binding. Covers and edges show light scuffing and bumping; small publisher stamp on edge of text block. Sewn binding. Cloth over boards. 8 x 9, 1202 pp. Audience: General/trade. 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 ... read more
Description: Good. Ships from the UK. Shows some signs of wear, and may have some markings on the inside. Your purchase also supports literacy charities. read more
Description: Good. 0262032937 *USED BOOK* Book may contain marking or highlights. Used items may not contain supplemental items such as CD, DVD, or other previously included items that would come with a NEW book. ALIBRIS. read more
Description: We are no longer able to guarantee delivery by Christmas. The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. 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 ... read more
Description: We are no longer able to guarantee delivery by Christmas. Please note that deliveries to addresses in the UK and Europe will be in 4-14 business days. Other countries should refer to Alibris standard times. The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. ... read more
"This is the ultimate knowledge base for algorithm problems and a massive source for optimization problems. Essential for every good software developer."
"I have not read this whole book. The whole book would take years to read in full. I took a one semester introductory course that uses this book. It is the standard introductory book to computer algorithms, covering a huge array of the most widely used applications in computer science. To my liking, the book is written more on the theoretical side, involving a lot of proofs along side pseudo-code exercises. However, as the material becomes quite involved, the book at times can be difficult and dense, and requires a re-read several times over. My favorite passage from this book encompasses the overall feel:
"Now we use our optimal substructure to show that we can construct an optimal solution to the problem from optimal solutions to subproblems. We have seen that any solution to a nontrivial instance of the matrix-chain multiplication problem requires us to split the product, and that any optimal solution contains within it optimal solutions to optimal subproblem instances. Thus, we can build an optimal solution to an instance of the matrix-chain multiplication problem by splitting the problem into two subproblems (optimally parenthesizing AiAi+1...Ak and Ak+1Ak+2...Aj), finding optimal solutions to subproblem instances, and then combining these optimal subproblem solutions. We must ensure that when we search for the correct place to split the product, we have considered all possible places so that we are sure of having examined the optimal one."
One suggestion: have a young child read this out loud to you. It will give them practice on reading, and it will allow you to listen carefully & slowly to what's being said. In fact, I encouraged the student I had (4th grade) to consider offering his services toward audio books, because it helped me a lot."
We guarantee every item's condition, as described on Alibris. If you are not satisfied that an item is as described, return your purchase for a refund.
rating
