quick_sort.cpp

Borland C++ Builder開發的Quick_sort演算法實作

#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;

void InterChange(int &a,int &b)
{
    int temp=a;
    a=b;
    b=temp;
}
void QuickSort(int list[],int left,int right)
{
    if(left < right)
    {
        int i = left, j = right + 1,
        pivot = list[left];
        do
        {
            do
                i++;
            while(list[i] < pivot);
            do
                j--;
            while(list[j] > pivot);
            if(i<j)
            {
                InterChange(list[i],list[j]);
            }
        }while(i < j);
        InterChange(list[left],list[j]);

        QuickSort(list, left, j-1);
        QuickSort(list, j+1, right);
    }
}
int main()
{
    int array[10000];
    time_t start,end;
    start=time(NULL);
    for(int i=0;i<10000;i++)
    {
        array[i]=rand()%1000;
    }
    QuickSort(array,0,9999);
    for(int i=0;i<10000;i++)
    {
        cout<<array[i]<<endl;
    }
    end=time(NULL);
    cout<<"time = "<<difftime(end,start)<<"sec."<<endl;
    system("pause");
    return 0;
}
//---------------------------------------------------------------------------