Question

What is the space complexity of the code that uses merge sort for determining the number of inversions in an array?

(a) O(n)

(b) O(log n)

(c) O(1)

(d) O(n log n)

My query is from Arrays Types in portion Arrays Types of Data Structures & Algorithms I

I have been asked this question in an international level competition.

Answer 1

Right answer is (a) O(n)

Best explanation: The space complexity required by the code will be O(n). It is the same as the space complexity of the code of standard merge sort.