develooper Front page | perl.fwp | Postings from September 2001

Re: binary trees in arrays

Thread Previous | Thread Next
From:
Tony Bowden
Date:
September 7, 2001 15:39
Subject:
Re: binary trees in arrays
Message ID:
20010906135937.A32345@blackstar.co.uk
On Thu, Sep 06, 2001 at 06:50:54AM -0500, David L. Nicol wrote:
> > http://www.bagley.org/~doug/shootout/bench/heapsort/heapsort.perl
> Surprised it isn't prototyped (&@) so that it could
> take a comparison function and sort an array in place.

If that makes it faster, send him a patch.

He's always trying to get the code for each language as fast as possible...

Tony

-- 
--------------------------------------------------------------------------
 Tony Bowden | tony@tmtm.com | http://www.tmtm.com/
             make me laugh make me cry enrage me don't try to disengage me
--------------------------------------------------------------------------

Thread Previous | Thread Next


nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About