day 19 3/18/98 ``I think you can just say it's obvious.''

This is a review day.

1. growth functions

log(m) £ log(n²) = 2*log(n) = O(log(n))
An algorithm with running time 2^cÖn run 2^dÖn has running time 2^(d+c)Ön = O(2^Ön)

File translated from T_EX by T_TH, version 1.30.