By: G Brassard
This is an introductory-level algorithm text which includes worked examples and detailed proofs, presenting algorithms by type rather than proof. The book begins with a compact, but complete introduction to some necessary maths, and also includes a long introduction to proofs by contradiction and mathematical induction to fill the gaps that many undergraduates have in their knowledge. It then goes on to provide a thorough introduction to the analysis of algorithms, and uses coherent notation and solving recurrences. It also includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms. This work is intended for use on undergraduate courses in Algorithms or Design and Analysis of Algorithms.
There are currently no reviews for this product. Be the first to review this product!
Your orders support book donation projects
NHBS never fails to deliver
Search and browse over 110,000 wildlife and science products
Multi-currency. Secure worldwide shipping
Wildlife, science and conservation since 1985