Updates for Assignment 4
------------------------


Problem 1
---------

Feel free to change the declaration of method perfectPack; in particular,
you may add any number of additional parameters. Note that w[] might be an
empty array.


Problem 3
---------

The program skeleton is provided to help you with the assignment, but if you
prefer you can modify it in any way you want.  It is unlikely, though, that
drastic modifications will improve the quality of the program.


Problem 5
---------

The definition of `Big-Oh':

f(n) = O(g(n)) iff.
there exist constants c, m such that f(n) < c * g(n) for all n>m.

Your task is to rank the functions and then determine above constants c and
m in order to prove your ranking.


Problem 7
---------

If the RunTime program reports `0 msecs' as running time, then your computer
is too fast!  The Java timer used for measurement has a limited resolution
(around 50 msecs on most machines), and anything below that will `rounded'
to zero.

If you cannot increase the number of integers (e.g. because you get
OutOfMemory exceptions), get the new RunTime2 class from the course home
page.  It increases the resolution by repeating each experiment a thousand
times and returning the average.

If you haven't started on problem 7 yet, we recommend that you use RunTime2.
State in your submitted solutions whether you used RunTime or RunTime2 for
your graphs.