develooper Front page | perl.perl5.porters | Postings from August 2001

Re: [PATCH perlfaq4] Faster permutation algorithms

Thread Previous | Thread Next
From:
Robin Houston
Date:
August 23, 2001 06:12
Subject:
Re: [PATCH perlfaq4] Faster permutation algorithms
Message ID:
20010823141224.A31791@puffinry.freeserve.co.uk
On Thu, Aug 23, 2001 at 01:41:54PM +0100, Matt Sergeant wrote:
> > +several times faster than the toy algorithm above.
> 
> s/toy //;
> 
> While it's a "toy", it's also easy to grok, so let's not bother with trying
> to pigeonhole it :-)

I meant "toy" in the best sense of the word. It wasn't intended as a
derogatory term, but I appreciate that it might be read that way, so
your change is probably a good idea.

As an analogy, consider the bubblesort algorithm. It's elegant and
easy to understand, so it's a good introduction to the area. But in
many practical applications, speed is more important than simplicity;
and anyway the programmer doesn't have to _understand_ S_qsort_sv
(for example) - it can be treated as a black box.

Rather than go into that, let's just take out the "toy" :-)

 .robin.

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