Introduction to the Design & Analysis of Algorithms
$111.00
82%off
$92.06
international edition with
same contents as the US
version. ... [more] ALTERNATE EDITION: This is the brand new
international edition with
same contents as the US
version. Why spend more?
Every order shipped with
tracking within one
business day. [less]
Own This Book? Sell It
9780321358288
ISBN:0321358287
Edition: 2nd Pub Date: 2006Publisher: Addison-Wesley Summary: AlgorithmsIntroduction to The Design & Analysis of Algorithms, 2nd EditionAnany Levitin, Villanova UniversityValued by students and trusted by instructors, Introduction to the Design and Analysis of Algorithms employs a comprehensive taxonomy of algorithm design techniques that is more powerful and intuitive than the traditional approach.It provides a coherent and pedagogically sound framework for learning and teachi [read more]
- 30-Day No-Hassle Returns
- Fast, Same-Day Customer Service
- The Best Prices on Textbook Rentals
- Find student loan options quickly and easily
- Compare loans to find the best fit for you
- Apply for the loan that meets your needs
9780321358288
ISBN:
0321358287
Edition: 2nd
Pub Date: 2006
Publisher: Addison-Wesley
AlgorithmsIntroduction to The Design & Analysis of Algorithms, 2nd EditionAnany Levitin, Villanova UniversityValued by students and trusted by instructors, Introduction to the Design and Analysis of Algorithms employs a comprehensive taxonomy of algorithm design techniques that is more powerful and intuitive than the traditional approach.It provides a coherent and pedagogically sound framework for learning and teaching algorithms. An extensive, detailed solutions manual is available online for the benefit of students and instructors. Student learning is further supported by exercise hints and chapter summaries. Popular puzzles and games provide motivation for students, and rhetorical questioning serves as an effective learning device.Ideal for a basic course in the design and analysis of algorithms, this Second Edition features 80 new puzzles and exercises, as well as:· Separate sections on the analysis of nonrecursive and recursive algorithms· Coverage of empirical analysis and algorithm visualization· Revised section on approximation algorithms · Brand-new chapter on iterative improvement algorithms covering the simplex method, network flows, maximum matching in bipartite graphs, and the stable marriage problem
- Track your recent orders.
- See our shipping rates & policies.
- Return an item (here's our Return Policy).

