My program uses divide and conquer strategy to find number of inversions.
(Similar to merge sort).

Time complexity is O(nlogn), still gives TLE for input size 100000.

Have I made mistake in calculating time complexity.
T(n) = 2T(n/2) + O(n).
O(n)- count function

So this recurrence ends to O(nlogn). still Im getting TLE

code- inversion count
problem - cracking interview series

Help me in finding my mistake.
Thanks