KevinStern/software-and-algorithms — pull request #3 by Gigatron (2013-05-18 00:13:44+00:00)
Title: Change the searching code in DynamicIntervalTree to make it more efficient

Using binary instead of the one-by-one approach:ｒeduce the time cost for search all overlapping intervals to O(log n + k)