|
|
|
Fundamentals of Computer Algorithms
|
 (Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Inhalt: |
| The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms. |
|