196 Pages 72 B/W Illustrations
by CRC Press

196 Pages 72 B/W Illustrations
by CRC Press

196 Pages 72 B/W Illustrations
by CRC Press

Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics... Read more
1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.

Biography

Anli Sherine, S. Albert Alexander