Problem Statement
Count pairs (i,j) where i < j and arr[i] > arr[j].
Approach
Merge sort. Count inversions during merge step.
Time & Space Complexity
Time O(n log n), Space O(n).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview