[Coursera]求组队一起讨论作业 Stanford Algorithms: Design and Analysis, Part 1

课程已经完结了，在看coursera上的录像，想找队友一起督促下作业~

题目都没看大懂。。。。。。
This 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 covered in the video lectures. The numeric answer for the given input file should be typed in the space below. So if your answer is 1198233847, then just type 1198233847 in the space provided without any space / commas / any other punctuation marks.

给你一个由1到100000构成的无序数组，用分治法求inversion的数目。inversion的定义自己看课件
数组中的数是按行存的，自己从给的文件中读出来