What is time complexity in Inversion Count Problem?

#1

Brute force approach gives O(n^2) complexity.
What will be the time complexity if we use merge sort to solve this problem?
Link to Code = https://ide.codingblocks.com/s/586345

#2

Hi @ikshuldureja130 with merge sort u can do it in O(NlogN)

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.