Fundamentals of Algorithmics

Brassard, Gilles/ Bratley, Paul

Pearson College Div（1995/04発売）

ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す

製本 Hardcover:ハードカバー版
言語 ENG
商品コード 9780133350685
DDC分類 511.8

Full Description

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.

1. Preliminaries. 2. Elementary Algorithmicss. 3. Asymptotic Notation. 4. Analysis of Algorithms. 5. Some Data Structures. 6. Greedy Algorithms. 7. Divide-And-Conquer. 8. Dynamic Programming. 9. Exploring Graphs. 10. Probabilistic Algorithms. 11. Parallel Algorithms. 12. Computational Complexity. 13. Heuristic and Approximate Algorithms. References. Index.