briterator

MergeSkylines could be O(n)

2

MergeSkylines calls erase in a loop potentially N times. Each call is O(n), making this function O(n^2). If you use an algorithm like std::unique this function would be O(n). pseudocode:...