Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Choosing the right sort (Or: WUDsamatter?)

by bart (Canon)
on Apr 19, 2005 at 08:14 UTC ( #449137=note: print w/replies, xml ) Need Help??


in reply to Choosing the right sort (Or: WUDsamatter?)

I don't get it. Your benchmark is completely bogus, you admit it in an update, but you only put that in a little remark at the bottom. So you're actually still pretending that everything is just fine.

You should fix the benchmark, for example by assigning the sort result to a lexical array in the subs, and rerun the benchmark, and strike through the flawed benchmark.

But no, you prefer to pretend everything is fine and dandy. You get a downvote from me. What a waste of time.

Update As per my request, friedo updated his node a little, pointing out the benchmark is flawed, there where it got inserted. At least, now people are prewarned. Me happy.

  • Comment on Re: Choosing the right sort (Or: WUDsamatter?)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://449137]
help
Chatterbox?
[atcroft]: PriNet: %hash = ();? or foreach my $k ( keys %hash ) { delete $hash{$k}; }?
[PriNet]: go figure, i just tried that, it retains some of the values (not the key) of the pre-assigned value

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (2)
As of 2017-06-28 02:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (619 votes). Check out past polls.