Computer Algorithms / C++ (Second Edition)

Horowitz, Ellis & Sahni, Sartaj & Rajasekaran, Sanguthevar

ISBN 10: 0929306422 / ISBN 13: 9780929306421

Published by Silicon Press, 2008

About this Item

774pp. Text sparsely highlighted and notated. Binding square. Covers are mildly edge worn from reading though clean. Does not include any access codes or supplements.

Seller Inventory # 71345

Bibliographic Details

• Title: Computer Algorithms / C++ (Second Edition)
• Publisher: Silicon Press
• Publication Date: 2008
• Language: English
• ISBN 10: 0929306422
• ISBN 13: 9780929306421
• Binding: Paperback. 8vo
• Edition: 2nd edition.
• Condition: Very good.
• Seller catalogs:
  • TECHNOLOGY

About this title

Synopsis

Brand new edition of the text that helped establish computer algorithms as discipline of computer science -- a thoroughly revised and updated edition. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.

From the Inside Flap

Spacer Cover; click to enlarge Computer Algorithms / C++ (2/E) by Horowitz, Sahni, & Rajasekaran ISBN 978-0-929306-42-1 2008 807 pages, Paperback $89.95 (US Dollars) Author Bios: Horowitz, Sahni, Rajasekaran Summary Reviews Latest C++ Edition of the Classic Algorithms Text! Brand new edition of the text that helped establish computer algorithms as discipline of computer science -- a thoroughly revised and updated edition. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.Computer Algorithms/C++ emphasizes: * Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed. * Examples: A wide range of examples provides students with the actual implementation of correct design. * The latest research: A thorough treatment of probabilistic and parallel algorithms is included. * Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared. Computer Algorithms/C++ is appropriate as a core text for upper- and graduate-level analysis of algorithms courses.