Askmeabout

Lets share our knowledge

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.

Q & A › Category: Data Structure › 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.
0 Vote Up Vote Down
Admin Staff asked 4 years ago

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

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

a) true