I know this is a stupid request. Currently insert/remove is testing using an O(n^2) algorithm. O(n log n) is possible. Yes, I'm working on large stuff where that matters. And this is a great example so I'm sure people are going to copy from this!
I know this is a stupid request.
Currently insert/remove is testing using an O(n^2) algorithm. O(n log n) is possible. Yes, I'm working on large stuff where that matters.
And this is a great example so I'm sure people are going to copy from this!