Frank
and Andreas are the first ones to do the mathematics on the doubling of the
bits and the running time. They discover that the running time does not double,
but increases by the square of the number of bits needed for the representation
of the number (which is the logarithm). Good job! And then they were so bored,
they used the AWT to get the input for the rational numbers to work.
Gregor
and Jenny plotted the results of the code fragment execution times, and you
can really see the quadratic vs. linear growth! They also give the results for
2^20, 2^40 and even (gasp) 2^60, so that you can see that the running time does
not double, but is much more (we are looking at the bits, not the numbers!).