1 619,00 1 61900
Sendes vanligvis innen 7-15 dager
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.
|Utgitt||1995||Forfatter||Gilles Brassard, Paul Bratley|
Pearson Prentice Hall Computin
|Antall sider||524||Dimensjoner||18,6cm x 24,4cm x 2,7cm|
|Vekt||862 gram||Leverandør||Bertram Trading Ltd|
|Emner og form||Mathematical theory of computation, Mathematical modelling|