Count insertion shifts

Implement int insertionShifts(int[] arr): the total number of shifts insertion sort would perform on arr — for each element, the number of earlier elements greater than it. Pure trace arithmetic, no sorting needed: for each i, count j < i with arr[j] > arr[i].