To say that Al's algorithm is ``big-oh'' of Bill's algorithm implies that Al's algorithm will run faster than Bill's for all input greater than somenon-zero positive integer $n_0$. In this case, $n_0 = 100$.