1.

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

Answer»

Right ANSWER is (d) O(n log n)

Explanation: The CODE of MERGE sort is slightly modified in order to calculate the number of inversions in an array. So the TIME complexity of merge sort remains unaffected and hence the time complexity is O(n log n).



Discussion

No Comment Found

Related InterviewSolutions