sort.h

经典算法实现

#ifndef sortH
#define  sortH
#define MAX ((unsigned)-1)
#define LARGEST 1000
#include <iostream>
#include <fstream>
#include <time.h>
using namespace std;

 extern int num;
 extern int *arr;


void heapSort();
void QuickSort();
void MergeSort(int start=0 ,int end=num-1);
void CountSort();
void shellSort();
#endif
//void quickSort();