Given an array nums, return how many pairs of positions i < j have nums[i] > nums[j] — pairs that appear in the wrong order compared with a sorted array. This count measures how unsorted an array is, and both solutions here are typical O(n²)Quadratic Time O(n²)Work that grows with the square of the input: doubling n makes it about four times slower. algorithms: two loops, one nested inside the other, each running up to n times. Quadratic code is fine for hundreds of values but becomes painfully slow for millions.