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>
Loading
Please register or sign in to comment
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>