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. This edition is no longer available. Please see the Second Edition of this title.
"synopsis" may belong to another edition of this title.
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs), and more.
This book's strength lies in its encyclopedic range, clear exposition, and powerful analysis. Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book is a great resource on the basic tools used to analyze the performance of algorithms.
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
"About this title" may belong to another edition of this title.
Shipping:
US$ 3.75
Within U.S.A.
Shipping:
US$ 4.00
Within U.S.A.
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!. Seller Inventory # S_411433428
Quantity: 1 available
Seller: SecondSale, Montgomery, IL, U.S.A.
Condition: Acceptable. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00073921571
Quantity: 1 available
Seller: SecondSale, Montgomery, IL, U.S.A.
Condition: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00075468104
Quantity: 1 available
Seller: SecondSale, Montgomery, IL, U.S.A.
Condition: Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00074504071
Quantity: 1 available
Seller: Goodwill Books, Hillsboro, OR, U.S.A.
Condition: Acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Seller Inventory # 3IIK3P006GUF_ns
Quantity: 1 available
Seller: Better World Books: West, Reno, NV, U.S.A.
Condition: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Seller Inventory # 4105436-6
Quantity: 1 available
Seller: Ergodebooks, Houston, TX, U.S.A.
Hardcover. Condition: Good. 2nd Edition. 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. This edition is no longer available. Please see the Second Edition of this title. Seller Inventory # SONG0262031418
Quantity: 1 available
Seller: 369 Bookstore _[~ 369 Pyramid Inc ~]_, Dover, DE, U.S.A.
Hardcover. Condition: USED_GOOD. There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference.Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics.Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject. Seller Inventory # AMPLE0262031418
Quantity: 1 available
Seller: TextbookRush, Grandview Heights, OH, U.S.A.
Condition: Good. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy. Seller Inventory # 53344001
Quantity: 1 available
Seller: Books Unplugged, Amherst, NY, U.S.A.
Condition: Good. Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within 4.9. Seller Inventory # bk0262031418xvz189zvxgdd
Quantity: 1 available