O（nlogn）+ O（n）的时间复杂度就是O（nlogn）吗？

Question

Let's say I have an array of length n and I sorted through it using a sorting algorithm with time nlogn . After getting this sorted array, I iterate through it to find any repeating elements with linear time. My understanding is that since the operations happened separately, this would be time O(nlogn) + O(n) and not O(nlogn+n) . If that's the case, would nlogn over take the linear time complexity making the final time complexity O(nlogn) ?

Answer 1

是的，因为对于大n，log（n）> 1，所以O（nlog（n））是O（n）的超集

Answer 2

O(nlogn) + O(n) and not O(nlogn+n)

There is no such thing; O ( n log n ) + O ( n ) and O ( n log n + n ) are equal, and both are equal to O ( n log n ). So it's not possible for a function to be in one and not the other.