O(n · log n) is not entirely correct as if you are counting comparisons then yes it's O(n · log n) but if you want to insert an element in the middle of the array you have to shift all the items right by one. Thus it can cost as much as n so the total cost can be:
I state that in the Time: Copies section.
We're a place where coders share, stay up-to-date and grow their careers.
We strive for transparency and don't collect excess data.