This repository contains a Python implementation of the merge sort algorithm with an added feature to count the number of inversions in an array. Inversions in an array occur when elements are not in ...

counting inversions using divide-and-conquer algorithm. This file "IntegerArray.txt" contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated.