C++基于比较的排序算法实现

#include <iostream>
#include <algorithm>
#include <time.h>

using namespace std;

void swap(int *arr, int m, int n);
void printArray(int *arr, int size);
int *generateRandomArray(int maxSize, int maxValue, int &size);
bool isEqual(int firstArr[], int secondArr[], int size);
int *copyArray(int oldArray[], int size);
void comarator(int *arr, int size);

//插入排序
void insertionSort(int *arr, int size);
//希尔排序
void shellSort(int *arr, int size);
void groupSort(int* a, int n, int i, int gap);
//选择排序
void selectionSort(int *arr, int size);
//堆排序
void heapInsert(int *arr, int index);
void heapify(int *arr, int index, int size);
void heapSort(int *arr, int size);
//冒泡排序
void bubbleSort(int *arr, int size);
//快速排序
void quickSort(int *arr, int size);
void quickSort(int *arr, int size, int l, int r);
int partition(int *arr, int size, int l, int r);
//归并排序
void mergeSort(int *arr, int size);
void mergeSort(int *arr, int size, int l, int r);
void merge(int *arr, int size, int l, int mid, int r);


bool forTest = false;
int srandNum1 = 0;
int srandNum2 = 100;


int main()
{
	if (!forTest)
	{
		int size = 0;
		int testTime = 5000;
		int maxSize = 10;
		int maxValue = 10;
		bool succeed = true;
		for (int i = 0; i < testTime; i++)
		{
			int *arr1 = generateRandomArray(maxSize, maxValue, size);
			int *arr2 = copyArray(arr1, size);
			mergeSort(arr1, size);
			comarator(arr2, size);
			if (!isEqual(arr1, arr2, size))
			{
				succeed = false;