About this title: Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely 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 ...
read more
Note: This is a general synopsis. Each listing is described below.
Edition: Illustrated.
Binding: Hardcover
Publisher: MIT Press
Date Published: 1990
ISBN-13:9780262031417ISBN:0262031418
Description: Fine. No dust jacket as issued. Text is clean and unmarked, binding tight. Boards have only very minor bumping. Sewn binding. Cloth over boards. 1028 p. Contains: Illustrations. Mit Electrical Engineering & Computer Science Series. Audience: General/trade. read more
Binding: Hardcover
Publisher: The MIT Press
Date Published: 1990-06-18
ISBN-13:9780262031417ISBN:0262031418
Description: New. Clean, Unmarked Copy, Priority Shipping recommended for prompt delivery by USPS when offered, Delivery Confirmation on all domestic items where available. read more
Edition: Illustrated.
Binding: Hardcover
Publisher: Mit Press
Date Published: 1990
ISBN-13:9780262031417ISBN:0262031418
Description: New in new dust jacket. 1992 Glossy Hardcover 6th Printing. No Remainder Mark, No Damage, 100% satisfaction guaranteed. Standard Delivery ONLY (Heavy Book). Sewn binding. Cloth over boards. 1048 p. Contains: Illustrations. Mit Electrical Engineering & Computer Science Series. Audience: General/trade. 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: Very Good. Great condition for a used book! Minimal wear. Shipped to over one million happy customers. Your purchase benefits world literacy! read more
Binding: Paperback
Publisher: Prentice Hall India
Date Published: 1000
ISBN-13:9788120321410ISBN:8120321413
Description: Excellent Conditon. SoftCover, Excellent Condition, clean/unmarked, tight binding, minor edge/cover wear, from a private collection. read more
Description: Excellent. [ No Hassle 30 Day Returns ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Torn pages: NO ] [ Broken Seams: NO ] Publisher: The MIT Press Pub Date: 9/30/2009 Binding: Hardcover Pages: 1312. read more
Description: Very good. 2001 MIT Press/McGraw-Hill 2nd Edition Hardcover(Textbook). No Dust Jacket(as issued), some wear to cover, text clean with strong binding. Ships Fast! read more
Binding: Paperback
Publisher: MIT Press
Date Published: 29/08/1990
ISBN-13:9780262530910ISBN:0262530910
Description: Used-Good. Book in good or better condition. Dispatched same day from warehouse. Please email with any questions for quick response. read more
Binding: Hardcover
Publisher: McGraw-Hill College
Date Published: 2001
ISBN-13:9780070131514ISBN:0070131511
Description: Hardcover. Not Pretty. All text is legible, may contain markings, cover wear, loose/torn pages or staining and much writing. SKU: 23669705 All orders shipped within 1 business day. 14 day money back guarantee ISBN: 9780070131514 Not Pretty. All text is legible, may contain markings, cover wear, loose/torn pages or staining and much writing. SKU: 23669705 All orders shipped within 1 business day. 14 day money back guarantee. read more
Binding: Hardcover
Publisher: McGraw-Hill Science/Engineering/Math
Date Published: 2001-07-16
ISBN-13:9780070131514ISBN:0070131511
Description: Good. All books in Acceptable-Good condition. Books may NOT include Online Access Codes (InfoTrac, MyEconLab). Books MAY contain highliting/bent pages. We ship M-F. read more
Binding: Hardcover
Publisher: MIT Press; McGraw-Hill, Cambridge, Mass. : New York
Date Published: c1990
ISBN-13:9780262031417ISBN:0262031418
Description: Fine. No dust jacket. Stated 23rd printing, 1999. Hard cover (no dj) shows slight wear along edges with two corners bumped. Book is in excellent condition. The MIT electrical engineering and computer science series. Unknown printing. xvii, 1028 p. : ill. ; 26 cm. Includes bibliographcal references (p. [987]-996) and index. read more
Binding: Hardcover
Publisher: McGraw-Hill College
Date Published: 2001
ISBN-13:9780070131514ISBN:0070131511
Description: Good. Hardcover. Used. May include moderately worn cover, writing, markings or slight discoloration. SKU: 23853813 All orders shipped within 1 business day. 14 day money back guarantee ISBN: 9780070131514. read more
Binding: Hardcover
Publisher: McGraw-Hill College
Date Published: 2001
ISBN-13:9780070131514ISBN:0070131511
Description: Good. Hardcover. Used. Bonus CD-ROM Included. May include moderately worn cover, writing, markings or slight discoloration. SKU: 23854815 All orders shipped within 1 business day. 14 day money back guarantee ISBN: 9780070131514. read more
Binding: Hardcover
Publisher: McGraw-Hill College
Date Published: 2001
ISBN-13:9780070131514ISBN:0070131511
Description: Fine. Hardcover. Almost New. Almost new condition. SKU: 23846277 All orders shipped within 1 business day. 14 day money back guarantee ISBN: 9780070131514. 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
