# Inversion count

Lets define inversion as pair of indicies i, j such that i < j and a_i >= a_j (a is our array)
Algorithm here has a complexity O(nlog_2n) and uses the idea of merge sort