|
|
|||
|
||||
OverviewThis book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithms development. The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. Full Product DetailsAuthor: Udi ManberPublisher: Pearson Education (US) Imprint: Pearson Dimensions: Width: 10.00cm , Height: 10.00cm , Length: 10.00cm Weight: 0.100kg ISBN: 9780201120370ISBN 10: 0201120372 Pages: 496 Publication Date: 01 January 1989 Audience: College/higher education , Tertiary & Higher Education Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsIntroduction. Mathematical Induction. Analysis of Algorithms. Data Structures. Design of Algorithms by Induction. Algorithms Involving Sequences and Sets. Graph Algorithms. Geometric Algorithms. Algebraic and Numeric Algorithms. Reductions. NP-Completeness. Parallel Algorithms.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |