Question

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

(a) true

(b) false

My enquiry is from Arrays Types in division Arrays Types of Data Structures & Algorithms I

This question was posed to me during an online interview.

Answer 1

Right choice is (a) true

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