Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re^6: Evolving a faster filter? (optimal!)

by tye (Cardinal)
on Jan 04, 2013 at 22:35 UTC ( #1011730=note: print w/ replies, xml ) Need Help??


in reply to Re^5: Evolving a faster filter? (optimal!)
in thread Evolving a faster filter?

Indeed!

And the number of choices that leaves you with is rather tiny.

Worse (or better), from throwing cases at the code, I bet it is possible to prove that all such orderings are optimal so that the one that sort gives you is optimal.

I think it might not be hard to prove and $a <= $b <= $c implies $a <= $c (assuming non-negative cost and selectivity between 0 and 1). And that should be enough.

- tye        


Comment on Re^6: Evolving a faster filter? (optimal!)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1011730]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2015-07-05 05:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (60 votes), past polls