Skip to content
Snippets Groups Projects
Commit ada02b06 authored by Nikodemus Siivola's avatar Nikodemus Siivola
Browse files

faster WHICHEVER

 Call RANDOM just once, and build an inline binary search tree
 for O(log n) goodness instead of O(n).

 Patch by: Gustavo <gugamilare@gmail.com>
parent d4a72df5
No related branches found
No related tags found
Loading
Loading
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment