#include
#include
using namespace std;
#define SELECTSORT
1
#define INSERTSORT
1
#define BUBBLESORT
1
#define SHELLSORT
1
#define QUICKSORT
1
#define MERGESORT
1
template
void print(T array[], int len)
{
}
template
void Swap(T& a, T& b)
{
}
#ifdef SELECTSORT
template
void SelectSort(T array[], int len)
{
}
#endif
#ifdef INSERTSORT
template
void InsertSort(T array[], int len)
{
}
#endif
#ifdef BUBBLESORT
template
void BubbleSort(T array[], int len)
{
}
#endif
#ifdef SHELLSORT
template
void ShellSort(T array[], int len)
{
}
#endif
#ifdef QUICKSORT
template
int parition(T array[], int low, int high)
{
}
template
void QSort(T array[], int low, int high)
{
}
template
void QuickSort(T array[], int len)
{
}
#endif
#ifdef MERGESORT
template
void Merge(T src[], T des[], int low, int mid, int high)
{
}
template
void MSort(T src[], T des[], int low, int high, int max)
{
}
template
void MergeSort(T array[], int len)
{
}
#endif