I am trying to find the number of inversions using merge sort, but I am
having trouble counting up the inversions. Any feedback would be helpful!
well, the function MergeSort does seem to return the number of inversions. i haven't gone through the code for MergeSort (or Merge for that matter), but it is clear that you are ignoring it's return value in main. should be something like
r = MergeSort(dataArray, 0, ARRAYSIZE-1);
// here, r should have the number of inversions for this sort