On Wed, Apr 2, 2008 at 12:43 AM, Imri Goldberg <lorgandon at gmail.com> wrote: > You cheated a little bit here - you gave it exponential increasing size > of input. Right > The time should grow only by O(n^2), which is still slow enough :) It seems that the execution time is roughly n^2 * 2*10^(-5) Strange...