Part 2
Algorithm Analysis
In this part we will learn how to analyse algorithms from their efficiency view point, and will introduced to some very significant results in computer science.
Chapter fourteen discusses in detail topics, like timing analysis, complexity, asymptotic growth rates, order notation and manipulation rules for the algorithms and some practical suggestions.
We are exposed to a number of examples of complexity calculation in chapter fifteen, which forms one of the key chapters o f this b ook. The concept of Amortized analysis, which charted a new approach to algorithm efficiency calculation, is discussed here.
There is empirical evidence that (CPU) Time and (Memory) Space can be traded while designing an algorithm. This idea ...
Get Design and Analysis of Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
