Q139
What is the time complexity of the code that uses merge sort for determining the number of inversions in an array?
A.
O(n2)
B.
O(n)
C.
O(log n)
D.
O(n log n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board