Re: Optimizing basic operations
- Posted by James_at_Euphoria Aug 02, 2013
- 5865 views
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].