四种排序算法(冒泡，选择，插入，归并)

#include<iostream>
#include<time.h>
#include<array>
#include<list>
using namespace std;
void Merge(int arr[], int low, int mid, int high);
void MergeSort(int arr[], int n);
int main(int argc, char ** argv)
{
time_t t; time(&t);  srand(t);
int ArraySize = 10000;
int * MyArray1 = new int[ArraySize];
//   =======================冒泡排序==========================   //


for (int x = 0; x < ArraySize; x++) {
MyArray1[x] = rand() % 1000;
}
int begin = clock();
for (int x = 0; x < ArraySize; x++) {
for (int y = 0; y < ArraySize - 1; y++) {
if (MyArray1[y] > MyArray1[y + 1])
{
MyArray1[y] ^= MyArray1[y + 1];
MyArray1[y + 1] ^= MyArray1[y];
MyArray1[y] ^= MyArray1[y + 1];
}
}
}
cout << "冒泡排序耗时  =   " << clock() - begin << endl;
//   ======================选择排序==========================   //

for (int x = 0; x < ArraySize; x++) {
MyArray1[x] = rand() % 1000;
}
begin = clock();
for (int x = 0; x < ArraySize; x++)
{
for (int y = x + 1; y < ArraySize; y++)
{
if (MyArray1[x] > MyArray1[y])
{
MyArray1[x] ^= MyArray1[y];
MyArray1[y] ^= MyArray1[x];
MyArray1[x] ^= MyArray1[y];
}
}
}
cout << "选择排序耗时  =   " << clock() - begin << endl;

//   =======================插入排序==============================  //
for (int x = 0; x < ArraySize; x++) {
MyArray1[x] = rand() % 1000;
}
begin = clock();
int preindex, current;
for (int x = 1; x < ArraySize; x++) {
preindex = x - 1;  current = MyArray1[x];
while (preindex >= 0 && MyArray1[preindex] > current)
{
MyArray1[preindex + 1] = MyArray1[preindex];
preindex--;
}
MyArray1[preindex + 1] = current;
}
cout << "插入排序耗时  =   " << clock() - begin << endl;


//   =======================归并排序==============================  //
for (int x = 0; x < ArraySize; x++) {
MyArray1[x] = rand() % 1000;
}
begin = clock();
MergeSort(MyArray1, ArraySize);
cout << "归并排序耗时  =   " << clock() - begin << endl;

getchar();
}
void Merge(int arr[], int low, int mid, int high)//递归和非递归均一样   
{//将两个有序区归并为一个有序区  
int i = low, j = mid + 1, k = 0;
int *temp = new(nothrow) int[high - low + 1];
while (i <= mid&&j <= high)
{
if (arr[i] <= arr[j])
temp[k++] = arr[i++];
else
temp[k++] = arr[j++];
}
while (i <= mid) temp[k++] = arr[i++];
while (j <= high) temp[k++] = arr[j++];
for (i = low, k = 0; i <= high; i++, k++)
arr[i] = temp[k];
delete[]temp;
}
//void MergeSort(int arr[],int low,int high)//递归版本的形参表   
void MergeSort(int arr[], int n)//参数和递归略不同，n代表数组中元素个数，即数组最大下标是n-1   
{//非递归实现   
int size = 1, low, mid, high;
while (size <= n - 1)
{
low = 0;
while (low + size <= n - 1)
{
mid = low + size - 1;
high = mid + size;
if (high>n - 1)//第二个序列个数不足size   
high = n - 1;
Merge(arr, low, mid, high);//调用归并子函数   
//cout << "low:" << low << " mid:" << mid << " high:" << high << endl;//打印出每次归并的区间   
low = high + 1;//下一次归并时第一关序列的下界   
}
size *= 2;//范围扩大一倍   
}
}