What is the time complexity of the code that uses merge sort for determining the number of inversions in an array?
(c) O(log n)
(d) O(n log n)
My doubt stems from Arrays Types topic in division Arrays Types of Data Structures & Algorithms I
The question was posed to me in an online interview.