## 12. ` `Analysis of Algorithms

This chapter focus on
the following topics:

We have spoken about of the various algorithms, and now it is time to
discuss the way in which the efficiency of sorting algorithms, and algorithms
in general, is
measured.` `
This is called complexity analysis, and it is a very important
and widely-studied subject
in computer science.` `
Our short introduction here touches only the surface of the subject.` `

Now you might say, it's obvious how to measure the efficiency of an algorithm.` `
Just code up the
algorithm as a program and run the program on some test data.` `
Measure the execution time, or
the memory required, and there you are.` `
If you want to know if one algorithm is more efficient
than another, do this for both of them and compare the results.

One important question is: How long does it take to get the result
(weather forcast, tower of Hanoi,
nuclear power plant, payroll, airplane ...).` `

Created by *unroff & hp-tools.*
© by Hans-Peter Bischof. All Rights Reserved (1998).
Last modified: 27/July/98 (12:14)