Data Structures and Algorithms with Object-Oriented Design Patterns in C#
next up previous contents index

Models and Asymptotic Analysis

To analyze the performance of an algorithm, we need to have a model of the computer. Chapter gif presents a series of three models, each one less precise but easier to use than its predecessor. These models are a similar, in that they require a careful accounting of the operations performed by an algorithm.

Next, Chapter gif presents asymptotic analysis. This is an extremely useful mathematical technique because it simplifies greatly the analysis of algorithms. Asymptotic analysis obviates the need for a detailed accounting of the operations performed by an algorithm, yet at the same time gives a very general result.


next up previous contents index

Bruno Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.