归并 排序

归并排序

随机生成N个数据，然后进行合并排序，输出N和比较次数
N从100变化到5000000把数据导入Excel，生成曲线，并求出趋势线及其公式，并从趋势线判断时间复杂度为n log n
附上代码和Excel截图

#define _CRT_SECURE_NO_WARNINGS 1
#include "time.h"
#include"stdlib.h"
#include"fstream"
#include<iostream>
#include<math.h>
using namespace std;
const int N = 5000000;
int temp[N],n=0;
int* generate_random1(int n, int l, int r) {
	srand(unsigned(time(NULL)));
	//int* a = (int *)malloc(sizeof(int) * n);free()(a);
	int* a = new int[n];
	for (int i = 0; i < n; i++)
		a[i] = (rand() % (r - l)) + l;
	return a;
}

void merge_sort(int q[], int l, int r) {
	if(l>=r) return;
	int mid = l + r>> 1;
	merge_sort(q, l, mid); merge_sort(q, mid + 1, r);
	int i = l, j = mid + 1, k = 0;
	while (i <= mid && j <= r) {
		if (q[i] <= q[j])
			temp[k++] = q[i++];
		else temp[k++] = q[j++];
		n++;
	}
	while (i <= mid)
		temp[k++] = q[i++];
	while (j <= r)
		temp[k++] = q[j++];
	for (int i = 0, j = l; j<=r; i++, j++) {
		q[j] = temp[i];
	}
}
int  main(){ 
	int* q;
	ofstream oFile;
	oFile.open("temp.csv", ios::out | ios::trunc);
	for(int a=10,i=0;a<10000;a=a+1,i++){
		n = 0;
		q = generate_random1(a, 0, a - 1);
		merge_sort(q, 0, a - 1);
		oFile << a*log2(a) << ',' << n << endl;
		cout<<n<<endl;
	}
	oFile.close();
	return 0;
}