Related to inversion count

#1

can anyone please tell me what is the time complexity of inversion count problem using recursion

#2

hi manthan joshi,
Inversion count using recursion is solved with merge sort technique and its time complexity is O(nlogn).