Results
1
comments of
Rico
Yeah, the complexity of Merge Sort is always O(nlogn). And, it is independent of initial sequence.