1. What must be true for a function f(n) to be O(g(n))?

  2. We graph the run times of two algorithms, and observe that over the
     part of the graph we can see, Algorithm 1 is always faster than
     Algorithm 2.  What can we conclude regarding their Big-O run times?


  3. True or False: 5n+3 is O(n^2) and O(n) (explain!).


  4. What is the smallest Big-O of the following routine? 

     ,----
     | public int sum(int a, int b){ return a+b; }
     `----