These are my notes from 4th lecture of discrete mathematics course taught at Arsdigita university by Shai Simonson. Other posts relating to this are here.

This lecture introduces the formalism to compare functions based on their order of growth. This is important for algorithms because actual running time of an algorithm is very sensitive to the implementation details, hardware its running on, load on the machine etc etc. So they can't be compared based on their actual running time but order of growth.

Here are my notes...

## Monday, August 10, 2009

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment