Data Structures and Algorithms
with Object-Oriented Design Patterns in Java 
To analyze the performance of an algorithm,
we need to have a model of the computer.
Chapter 
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 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.
Copyright © 1998 by Bruno R. Preiss, P.Eng. All rights reserved.