SUMMARY
Efficiency and Complexity

In general we can deduce the following properties of certain types of algorithms:

Type
Complexity
Linear (sequential) algorithmO(1)
Linear searchO(n)
Singly nested loopO(n)
Multiply (m) nested loopO(nm)
Dividing search
(Binary, Fibonacci searches)
O(lg n)

[Prev][TOC][Next]


Last updated 2000/01/30
© J.A.N. Lee, 2000.