A file contains a list of all of the 1,00,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated. task is Compute the number of inversions in the file given, where the ith row of the file indicates the ith entry of an array. implement Divide-and-conquer algorithm because of the large size of the given array. Output Expected : A numeric answer for the given input file specifying the number of inversions.

Question

A file < Array_of_Integers .txt> contains a list of all of the 1,00,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated. task is Compute the number of inversions in the file < Array_of_Integers .txt> given, where the ith row of the file indicates the ith entry of an array. implement Divide-and-conquer algorithm because of the large size of the given array. Output Expected : A numeric answer for the given input file specifying the number of inversions.