Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

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

by tye (Sage)
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?


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?

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2016-10-22 01:06 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (291 votes). Check out past polls.