Algorithm Design: A Methodological Approach - 150 problems and detailed solutions

Table of Contents

Preface






Mathematics and Computer Science: Some Useful Notions



Complexity of an Algorithm



Specifications, Invariants, Iteration



Reduce and Conquer, Recursion



Generate and Test



Branch and Bound



Greedy Algorithms



Divide and Conquer



Dynamic Programming

Notations

List of Problems

Bibliography

Index

Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.

• Teoria matemática da computação
• Programação e linguagens de script: geral
• Algoritmos e estruturas de dados
• Engenharia do software
• Matemática aplicada

Pedagogical;Methodological;Design;Solutions;Problems;Algorithm;Hilbert Curve;Search Tree;Queue OPEN;Priority Queue;Induction Hypothesis;Heuristic Function;Elementary Strokes;Inverted Triangle;Hamiltonian Cycle;Hamiltonian Path;Evaluation Function;Elementary Operation;Manhattan Distance;Uniform Cost;Bottom Triangle;Elementary Triangle;Double Squares;Recursive Call;Maximum Complexity;Asymptotic Time Complexity;Convex Polygon;Reduction Model;Average Complexity;Function Calc;Geometric Progression