$start = Benchmark->new();

#RUN THE ALGORITHM
@sorted_numbers = sort { $a <=> $b } @numbers;

$end = Benchmark->new();
$diff = timediff( $end, $start );
[download]

I'm a bit confused

Using time to measure code execution is not going to be accurate everytime it is run. What if the load on the cpu is heavier during one test, say for example because a cron job is running, or whatever else is eating up cpu cycles. The only way to really measure code execution, is how many cpu cycles it takes to get the task done, the time taken is a function of many things going on in the computer, from random delays in hard drive access, other processes suddenly using up cpu cycles, and just plain randomness. The way to get a good benchmark, would be to run the test code a thousand times over the course of a day, and take the average time.

See Lies, Damn Lies and Benchmarks and No More Meaningless Benchmarks! for example. You can google for more discussions on the deceptive nature of benchmarks yourself.

---

I'm not really a human, but I play one on earth.
Old Perl Programmer Haiku ................... flash japh

Thank you for your suggestions.

"..However it takes much more than that.."
How do you know that?

Thank you for your answer. I meant I waited too much to finish it. Additionally, The code

my $start_time = [Time::HiRes::gettimeofday()];
.
.
.
my ($user, $system, $child_user, $child_system) = times;
print "wall clock time was ", Time::HiRes::tv_interval($start_time), "
+\n",
    "user time for $$ was $user\n",
    "system time for $$ was $system\n",
    "user time for all children was $child_user\n",
    "system time for all children was $child_system\n";
[download]

gives different results with respect to benchmark. Sorry for any foolish comments.