Suppose we are considering two algorithms, A and B,
for solving a given problem.
Furthermore, let us say that we have done a careful analysis
of the running times of each of the algorithms and determined them to be
and , respectively,
where n is a measure of the problem size.
Then it should be a fairly simple matter to compare the
two functions...
