#include <iostream>
#include <algorithm>
#include "SortTestHelper.h"
#include <String>
#include "Student.h"
#include "SortFunction.h"
using namespace std;
//递归使用归并排序，对
template <typename T>
void __mergeSort(T arr[] , int l, int r){

}
//归并排序过程merge   拿内存换空间
template <typename T>
void mergeSort(T arr[] , int n){
    __mergeSort(arr , 0 , n-1);
}


int main() {
    int n = 20000;
    int *arr = SortTestHelper::generateRandomArray(n , 0 , n);
    int *arr2= SortTestHelper::copyIntArray(arr,n);
    int *arr3= SortTestHelper::copyIntArray(arr,n);
//    selectionSort(arr , n);
//    SortTestHelper::printArray( arr , n );
//    SortTestHelper::testSort("Selection Sort", selectionSort,arr,n);
//    Student c[4] = {{"D",90},{"C",100},{"B",95},{"A",95}};
//    selectionSort(c,4);
//    SortTestHelper::printArray( c , 4 );
    SortTestHelper::testSort("Selection Sort", selectionSort,arr,n);
    SortTestHelper::testSort("Inserting Sort", insertionSort,arr2,n);
    SortTestHelper::testSort("Inserting2 Sort", insertionSort2,arr3,n);

    delete[] arr;
    delete[] arr2;
    return 0;
}