Adjacent Swaps to Sort

Sequel to https://puzzlespree.substack.com/p/minimum-swaps-for-market-signal-sorting

Problem Statement

You are given an array of integers. You want to sort the array in ascending order using only swaps of adjacent elements. Determine the minimum number of such swaps required to accomplish this.

Examples

Example 1
Input: [4, 3, 1, 2, 5]
Output: 5
Explanation:
One valid sequence of adjacent swaps:
    1) [4, 3, 1, 2, 5] → [3, 4, 1, 2, 5]
   …