An inversion list is a concept often used in the context of data structures and algorithms, particularly in sorting. Inversions in an array or a list refer to pairs of elements where the first element is greater than the second element but appears before it in the array. Specifically, for an array \(A\), an inversion is a pair of indices \( (i, j) \) such that \( i < j \) and \( A[i] > A[j] \).
New to topics? Read the docs here!