hi every one , i'm new in programming and i have a programming assignement to do and i have to submit it in less than 3 hours pleas help me out here is the question : The file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated.

Your task is to compute the number of inversions in the file given, where the ith row of the file indicates the ith entry of an array.
Because of the large size of this array, you should implement the fast divide-and-conquer algorithm .

i want to do it using c programming language ho can i treat the problem and make a code to get the right answer ?

Question

hi every one , i'm new in programming and i have a programming assignement to do and i have to submit it in less than 3 hours pleas help me out here is the question : The file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated.

Your task is to compute the number of inversions in the file given, where the ith row of the file indicates the ith entry of an array.
Because of the large size of this array, you should implement the fast divide-and-conquer algorithm .

i want to do it using c programming language ho can i treat the problem and make a code to get the right answer ?