What is the time complexity of the code that uses merge sort for determining the number of inversions in an array? Q & A › Category: Data Structure › What is the time complexity of the code that uses merge sort for determining the number of inversions in an array? 0 Vote Up Vote Down Admin Staff asked 4 years ago What is the time complexity of the code that uses merge sort for determining the number of inversions in an array? a) O(n2) b) O(n) c) O(log n) d) O(n log n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago d) O(n log n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...
Admin