Vidyalelo
Data Structure · Q175

Arrays in Data Structures

Programming · Data Structure · question 175

Q175

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
Answer
B.
false

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board