Complexity guarantees Average complexity for insert element is at most logarithmic. Average complexity for insert range is at most O(N * log(size() + N)), where N is j – i.
Average complexity for insert element is at most logarithmic.
Average complexity for insert range is at most O(N * log(size() + N)), where N is j – i.
