Quick pass at a SortedArray implementation in Ruby backed by binary search, comes in handy quite a bit: https://gist.github.com/3828839 /cc @bascule
-
-
Replying to @ryanlecompte
@ryanlecompte what I really need for timers is a heap with O(1) retrieval of the first element1 reply 0 retweets 0 likes
Replying to @ryanlecompte
@ryanlecompte heh, nice!
7:31 PM - 3 Oct 2012
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.