sort.h
#ifndef SORT_H
#define SORT_H
class Sort {
private:
int TestTime;
int MaxSize;
int MaxValue;
int ArrayLength;
public:
void Test();
void SetValue(int,int,int);
void PrintArray(int[]);
int* CopyArray(int[]);
void BubbleSort(int [], int );
void InsertionSort(int[], int);
void SelectionSort(int[], int);
void QuickSort(int[], int,int);
void MergeSort(int[], int,int);
void HeapSort(int[], int);
void RadixSort(int[],int);
void BuildHeap(int[], int);
void Swap(int[], int,int);
void Comparator(int[],int);
bool IsEqual(int[], int[]);
int* GeneratorRandomArray();
};
#endif
main.cpp
#include"Sort.h"
#include<stdlib.h>
#include<time.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main() {
Sort test;
test.SetValue(500000, 10, 50);
test.Test();
}
void Sort::Test() {
bool succeed = true;
srand((unsigned)time(NULL));
for (int i = 0;