LeetCode 56 Merge Intervals - Why Naive Fails

Compare every pair of intervals. If they overlap, merge them and repeat.

With $n$ intervals, there are $O(n^2)$ pairs. After each merge, you might need to recheck.

Worst case: $O(n^3)$ operations. Sorting first makes this much simpler.