You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In my analysis, there may be a large number of intervals involved. When I traverse a large number of intervals to determine if they overlap with other intervals, the time complexity is O(n^2). However, if interval trees are used for overlap detection, the complexity becomes O(nlogn). Does the underlying principle of this module involve the use of interval trees or other suitable data structures? :)
The text was updated successfully, but these errors were encountered:
There are several optimizations especially to handle large disjunctions of intervals. I would say: try it and see whether the performances meet your expectations or not :-)
In my analysis, there may be a large number of intervals involved. When I traverse a large number of intervals to determine if they overlap with other intervals, the time complexity is O(n^2). However, if interval trees are used for overlap detection, the complexity becomes O(nlogn). Does the underlying principle of this module involve the use of interval trees or other suitable data structures? :)
The text was updated successfully, but these errors were encountered: