Can express run time as a recurrence relation: T(a,0) = 1,
if b>0.
Recall that we are interested in computing the worst-case running time for this process. (Why?)
Some of the obvious candidates for this don't work out. For
example, how big is compared to b? Neither of these hold
for all a and b: