Re: Optimizing basic operations

new topic     » goto parent     » topic index » view thread      » older message » newer message
Spock said...

When the loop exits list will contain the top 100. shufflelist() simply inserts "this" somewhere in list and drops the last element.

I see. What you're saying is that the time spent doing a shufflelist() plus finding the lowest eval would be faster than a true sort plus lowest_eval = sorted_eval_list[$][1].

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu