排序算法实现

一、快速排序

#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cstdarg>
#include <Windows.h>

using namespace std;

int test[20] = {33, 25, 20, 21, 0, 99, 21, 45, 37, 61, 55, 82, 43, 76, 9, 44, 2, 54, 13, 71};

template<typename T>
void MySwap(T& a, T& b)
{
    T x = a;
    a = b;
    b = x;
}

template<typename T>
T MyPartition(T* pList, int low, int high)
{
    int pivot = high;

    while(low < high)
    {
        while(low < high && pList[low] <= pList[pivot])
            ++low;
        MySwap(pList[low], pList[pivot]);
        pivot = low;

        while(low < high && pList[high] >= pList[pivot])
            --high;
        MySwap(pList[pivot], pList[high]);
        pivot = high;
    }

    return high;
}


template<typename T>
void QuickSort(T* p, int l, int r)
{
    T pivot;
    if(l < r)
    {
        pivot = MyPartition(p, l, r);

        QuickSort(p, l, pivot - 1);
        QuickSort(p, pivot + 1, r);
    }

    return;
}

template<typename T>
void PrintArray(T* pArray, int nLen)
{
    for(int i = 0; i < nLen; ++i)
    {
        cout << pArray[i] << ' ';
    }
    cout << endl << endl;
}

int main(int argc, char const *argv[])
{
    //srand((unsigned)time(NULL));

    int nLenth = sizeof(test) / sizeof(*test);
    PrintArray(test, nLenth);
    QuickSort(test, 0, nLenth - 1);
    PrintArray(test, nLenth);

    return 0;
}

二、未完，待续