Question

The time complexity of the code that determines the number of inversions in an array using merge sort is lesser than that of the code that uses loops for the same purpose.

(a) true

(b) false

I want to ask this question from Arrays Types topic in section Arrays Types of Data Structures & Algorithms I

I had been asked this question in homework.

Answer 1

The correct choice is (a) true

The best explanation: The time complexity of the code that determines the number of inversions in an array using merge sort is O(n log n) which is lesser than the time complexity taken by the code that uses loops.