Items related to Foundations of Algorithms, 4/e
Synopsis
Revised and updated, the Fourth Edition of Foundations of Algorithms continues to offer a well-balanced presentation of algorithm design, complexity of algorithms and computational complexity. Perfect for mainstream computer science students with a background in college algebra and discrete structures, this edition presents mathematical concepts using lucid explanations and a simpler notation than is found in most texts. The authors reinforce key algorithmic explanations with numerous concrete examples to help students grasp theoretical concepts. Key Features Now makes use of C ++ and Java pseudocode, helping students understand complex algorithms. A Chapter on numerical algorithms includes a review of basic number theory, Euclid's Algorithm for finding the greatest common divisor, a review of modular arithmetic, an algorithm for solving modular linear equations, an algorithm for computing modular powers, and the new polynomial-time algorithm for determining whether a number is prime. Contains numerous examples throughout, ensuring that students have a clear grasp of the complex algorithms being discussed. A review of essential mathematical concepts is presented in three appendices.
"synopsis" may belong to another edition of this title.
- ISBN 10 9380108877
- ISBN 13 9789380108872
- BindingPaperback
- LanguageEnglish
- Number of pages300
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
