(逆序计算的递归 C++实现) Coursera 斯坦福大学 算法课程 Programming Assignment #2

题目

第 1 个问题

Download the following text file:
IntegerArray.txt

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 ithi^{th}ith row of the file indicates the ithi^{th}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. You can make up to 5 attempts, and we’ll use the best one for grading.

(We do not require you to submit your code, so feel free to use any programming language you want — just type the final numeric answer in the following space.)

[TIP: before submitting, first test the correctness of your program on some small test files or your own devising. Then post your best test cases to the discussion forums to help your fellow students!]

程序

#include <iostream>
#include <fstream>
#include <cassert>
#include <string>
#include <cstdlib>
#include <vector>

using namespace std;

void readTxt(string file, vector<int>& outVec)
{
   
    ifstream infile;
    infile.open(file.data());
    assert(infile.is_open