涉及知识点:①生成随机数组 ②归并排序 ③计算程序运行时间
#include<iostream>
#include<cstdlib>
#include<time.h>
#include<stdio.h>
#include<ctime>
using namespace std;
void Random(int* x, int n, int l, int r)//生成n个范围在l~r的随机数,并初始化数组
{
cout << "原始数组:" << endl;
srand(time(0));//因为rand是伪随机数函数,虽生成随机数,但每次生成的随机数都相同
for (int i = 0; i < n; i++) {
x[i] = rand() % (r - l + 1) + l;//用n个随机数列初始化数组
cout << x[i] << endl;//输出原始随机数组
}
}
void merge(int a[], int low, int mid, int high)//合并函数,比较并合并,low为第一个元素,high为最后一个元素
{
int i = low, j = mid + 1, k = 0;
int* temp = new(nothrow)int[high - low + 1];//暂存合并的有序序列
if (!temp)//内存分配失败
{
cout << "error";
return;
}
while (i <= mid && j <= high) {
if (a[i] <= a[j])//较小的先存入temp中
temp[k++] = a[i++];
else
temp[k++] = a[j++];
}
while (i <= mid)//第一有序区有剩余
temp[k++] = a[i++];
while (j <= high)//第二有序区有剩余
temp[k++] = a[j++];
for (i = low, k = 0; i <= high; i++, k++)//将排好序列的存回a[]中
{
a[i] = temp[k];
}
delete[]temp;
}
void mergesort(int* a, int low, int high)//归并排序
{
if (low < high) {
int mid = (low + high) / 2;
mergesort(a, low, mid);//将数组分成两大组并分组进行拆分
mergesort(a, mid + 1, high);
merge(a, low, mid, high);
}
}
int main() {
clock_t start, finish;//声明开始时间和结束时间
start = clock();//clock函数的功能是返回从“开启这个程序”到程序中再次调用clock函数时之间的CPU时钟计时单元数
int a[20];
Random(a, 20, 1, 100);
mergesort(a, 0, 19);
cout << "排列后数组:" << endl;
for (int i = 0; i < 20; i++) {
if ((i + 1) % 5 == 0)cout << a[i] << '\n';
if ((i + 1) % 5 != 0)cout << a[i] << '\t';
}
finish = clock();
cout << "\n 程序运行时间:" << (double)(finish - start) / CLOCKS_PER_SEC * 1000.0 << "(ms)" << endl;
//CLOCKS_PRE_SEC是常量,用来表示一秒钟会有多少个时钟计时单元,注意clock_t是长整型,返回的是整型,所以要用double
return 0;
}
归并排序学习参照: