On Fri, 11 Apr 2008 10:59:57 EDT, Mark Lord said:The nice thing about binary search is that it's by definition an O(log2(N)) operation, which isn't bad at all as far as algorithms go. The truly blunt instrument here would be a linear search of every commit...
