1.  What is the big-O of this routine (explain!) 
     ,----
     | List<Integer> l = new LinkedList<Integer>(); //<---!!!
     |
     | // ...
     |
     | for(int i=0;i<l.size();i++)
     |   System.out.println(""+i": "+l.get(i));
     `----
     
  2. What is the big-O of this recurrence relation?
  
     ,----
     | T(1) = 1
     | T(n) = 1 + T(n/2)
     `----