八大排序算法的排序时间长度的比较，测试数据10000000时部分结果如下
输入测试数据长度: 10000000
数据初始化中...
数据初始化完成!
堆排序用时: 8秒 499毫秒
快速排序用时: 22秒 35毫秒
归并排序用时: 34秒 473毫秒
另外五种排序本人并未等待结果，读者可自行测试
测试时请注意内存消耗，以免数据太大，内存不够，可自行测试单一算法以便增加可测试数据数目
#include <iostream>
#include <ctime>
#include <iomanip>
using namespace std;
int NUM; //测试数据大小
const int SortFunNum = 8;
template <typename T> void BubleSort(T a[], int, int);
template <typename T> void SelectSort(T a[], int, int);
template <typename T> void InsertSort(T a[], int, int);
template <typename T> void RankSort(T a[], int, int);
template <typename T> void Merge(T a[], int, int , int);
template <typename T> void MergeSort(T a[], int, int);
template <typename T> int Partition(T a[], int, int);
template <typename T> void QuickSort(T a[], int, int);
template <typename T> void ShellSort(T a[], int, int);
template <typename T> void HeapSort(T a[], int, int);
void Test()
{
cout << "数据初始化中..." << endl;
int **testData = new int *[SortFunNum];
for (int i = 0; i < SortFunNum; ++i)
testData[i] = new int[NUM];
for (int k = 0; k < NUM; ++k)
{
testData[0][k] = rand();
for (int j = 1; j < SortFunNum; ++j)
testData[j][k] = testData[0][k];
}
cout << "数据初始化完成!" << endl;
clock_t begin, end;
begin = clock();
HeapSort(testData[6], 0, NUM - 1);
end = clock();
cout << setw(20) << "堆排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
QuickSort(testData[5], 0, NUM - 1);
end = clock();
cout << setw(20) << "快速排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
MergeSort(testData[4], 0, NUM - 1);
end = clock();
cout << setw(20) << "归并排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
InsertSort(testData[2], 0, NUM - 1);
end = clock();
cout << setw(20) << "插入排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
ShellSort(testData[7], 0, NUM - 1);
end = clock();
cout << setw(20) << "希尔排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
SelectSort(testData[1], 0, NUM - 1);
end = clock();
cout <<setw(20) << "选择排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
RankSort(testData[3], 0, NUM - 1);
end = clock();
cout << setw(20) << "计数排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
begin = clock();
BubleSort(testData[0], 0, NUM - 1);
end = clock();
cout << setw(20) << "冒泡排序用时: " << setw(4) << (end - begin) / CLOCKS_PER_SEC << "秒" << setw(4) <<
1000 * double((end - begin) % CLOCKS_PER_SEC) / CLOCKS_PER_SEC << "毫秒" << endl;
for (int i = 0; i < SortFunNum; ++i)
delete[] testData[i];
delete[] testData;
}
int main()
{
srand(time(0));
while (1)
{
cout << "输入测试数据长度: ";
cin >> NUM;
Test();
cout << "测试完成!" << endl << endl;;
}
cin.get();
cin.get();
return 0;
}
/*冒泡排序*/
template <typename T>
void BubleSort(T a[], int first, int last)
{
int has = 1;
for (int i = last; i > first && has; --i)
{
has = 0;
for (int j = first; j < i; ++j)
{
if (a[j] > a[j + 1])
{
swap(a[j], a[j + 1]);
has = 1;
}
}
}
}
/*选择排序*/
template <typename T>
void SelectSort(T a[], int first, int last)
{
int m;
for (int i = last; i > first; --i)
{
m = i;
for (int j = first; j < i; ++j)
{
if (a[j] > a[m])
m = j;
}
swap(a[m], a[i]);
}
}
/*插入排序*/
template <typename T>
void InsertSort(T a[], int first, int last)
{
int j;
T t;
for (int i = first + 1; i <= last; ++i)
{
t = a[i];
j = i - 1;
while (a[j] > t && j >= 0)
{
a[j + 1] = a[j];
--j;
}
a[j + 1] = t;
}
}
/*计数排序*/
template <typename T>
void RankSort(T a[], int first, int last)
{
int sum = last - first + 1;
int *rank = new int[sum];
T *b = new T[sum];
for (int i = 0; i < sum; ++i)
{
rank[i] = 0;
b[i] = a[first + i];
}
for (int m = first; m <= last; ++m)
{
for (int n = first; n < m; ++n)
{
if (a[m] > a[n])
rank[m - first]++;
else
rank[n - first]++;
}
}
for (int k = 0; k < sum; ++k)
{
a[first + rank[k]] = b[k];
}
delete[] b;
delete[] rank;
}
/*归并，用于归并排序*/
template <typename T>
void Merge(T a[], int first, int mid, int last)
{
if (last - first < 1)
return;
T *b = new T[last - first + 1];
int m = first, n = mid, bi = -1;
while (m < mid && n <= last)
{
if (a[m] > a[n])
b[++bi] = a[n++];
else
b[++bi] = a[m++];
}
while (m < mid)
b[++bi] = a[m++];
while (n <= last)
b[++bi] = a[n++];
while (bi >= 0)
{
a[first + bi] = b[bi];
--bi;
}
delete[] b;
}
/*归并排序*/
template <typename T>
void MergeSort(T a[], int first, int last)
{
if (last - first + 1 >= 2)
{
int mid = (first + last) / 2;
MergeSort(a, first, mid);
MergeSort(a, mid + 1, last);
Merge(a, first, mid + 1, last);
}
}
/*划分，用于快速排序*/
template <typename T>
int Partition(T a[], int first, int last)
{
swap(a[rand() % (last - first + 1) + first], a[last]); //随机交换
int m = last;
int j = first - 1;
for (int i = first; i < last; ++i)
{
if (a[i] < a[m])
{
++j;
swap(a[j], a[i]);
}
}
swap(a[m], a[j + 1]);
return j + 1;
}
/*快速排序*/
template <typename T>
void QuickSort(T a[], int first, int last)
{
if (last - first + 1 >= 2)
{
int m = Partition(a, first, last);
QuickSort(a, first, m - 1);
QuickSort(a, m + 1, last);
}
}
/*希尔排序*/
template <typename T>
void ShellSort(T a[], int first, int last)
{
int sum = last - first + 1;
T t;
int j;
for (int d = sum / 2; d >= 1; d /= 2)
{
for (int i = d; i <= sum; i += d)
{
t = a[first - 1 + i];
j = i - d;
while (j >= 0 && a[first - 1 + j] > t)
{
a[first - 1 + j + d] = a[first - 1 + j];
j -= d;
}
a[first - 1 + j + d] = t;
}
}
}
/*堆排序*/
template <typename T>
void HeapSort(T a[], int first, int last)
{
int num = last - first + 1;
int f, c;
T t;
for (f = num / 2; f >= 1; --f)
{
c = f * 2;
t = a[first - 1 + f];
while (c < num)
{
if (c + 1 <= num && a[first + c] > a[first - 1 + c])
++c;
if (t > a[first - 1 + c])
break;
a[first - 1 + c / 2] = a[first - 1 + c];
c *= 2;
}
a[first - 1 + c / 2] = t;
}
while (num > 1)
{
swap(a[first], a[first + num - 1]);
c = 2;
t = a[first];
while (c < num)
{
if (c + 1 < num && a[first + c] > a[first - 1 + c])
++c;
if (a[first - 1 + c] < t)
break;
a[first - 1 + c / 2] = a[first - 1 + c];
c *= 2;
}
a[first - 1 + c / 2] = t;
--num;
}
}