| Computer Algorithms: Introduction to Design and Analysis Contributor(s): Baase, Sara (Author), Van Gelder, Allen (Author) |
|
 |
ISBN: 0201612445 ISBN-13: 9780201612448 Publisher: Pearson OUR PRICE: $196.32 Product Type: Paperback Published: November 1999 Annotation: Drawing upon combined decades of teaching experience, Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for anyone interested in gaining a solid understanding of computer algorithm analysis and design. This edition features the addition of new topics such as computing with DNA, the accelerated version of heapsort, and dynamic sets, as well as an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. This edition features implementations in a Java-like pseudocode, and includes an appendix with Java examples. |
| Additional Information |
| BISAC Categories: - Computers | Programming - Algorithms - Computers | Computer Science |
| Dewey: 519.7 |
| LCCN: 99014185 |
| Physical Information: 1.26" H x 7.8" W x 9.51" (2.76 lbs) 720 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: have extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. Highlights *Emphasizes the development of algorithms through a step-by-step process rather than merely presenting the end result * Stresses the importance of the algorithm analysis process-continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained * Provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique * Uses a Java-like pseudocode; includes an appendix with Java examples 0201612445B04062001 |