Minimum Adjacent Swaps to Sort

Print the minimum number of swaps of adjacent elements needed to sort a distinct-element array in ascending order.

1 <= n <= 10^5