📈 Chaos Meter

📚 Inversion Count

Inversions measure how far an array is from being sorted.

• Definition: Pair (i, j) where i < j but arr[i] > arr[j]
• Sorted array: 0 inversions
• Reverse sorted: n(n-1)/2 inversions (maximum)
• Efficient count: Modified merge sort O(n log n)