Reverse Pairs#LeetCodewhck6January 28, 2018Big O(n2) for (let i = 0; i < nums.length; i++) { for (let j = 0; j < nums.length; j++) { if (i < j && nums[i] > 2 * nums[j]) { x++; } } }