教科書的快速排序算法

int partition(int numbers[] ,int first,int end)
{
        int i = first,j = end;
        int piov = numbers[first];
        while(i < j)
        {   
                while(i < j && numbers[j] >= piov) j--;
                numbers[i] = numbers[j];
                while(i < j && numbers[i] <= piov) i++;
                numbers[j] = numbers[i];
        }   
        numbers[i] = piov;
        return i;
}
int quicksort(int numbers[],int first, int end)
{
        /* ensure two elements in array */
        if(first < end - 1)
        {   
                int pivot = partition(numbers,first,end);
                quicksort(numbers,first,pivot);
                quicksort(numbers,pivot + 1, end);
        }   
}
int main()
{
        int a[] = {9,5,4,6,8,0,1,3,2,7};
        quicksort(a,0,9);
        int len = sizeof(a)/sizeof(a[0]);
        while(len--)
        {   
                printf("%d ",a[len]);
        }   
}

劍指offer的快速排序算法

算法的主要思路是，選隨機(jī)選取一個(gè)介于數(shù)組長度與0之間的數(shù)，然后以這個(gè)數(shù)為基準(zhǔn)，數(shù)組左邊的小于這個(gè)數(shù)，數(shù)組右邊的數(shù)都大于這個(gè)數(shù)。遞歸下去就可以把整個(gè)數(shù)組排序。

#include <iostream>
using namespace std;

int partition(int numbers[],int start,int end,int length)
{
        if(numbers == NULL || start <0 || end > length)
        {   
                return -1; 
        }   
        int index = RandonInRange(start,end);
        Swap(&numbers[index],&numbers[end]);
        int small = -1; 
        for(index = 0; index < end;index++)
        {   
                if(numbers[index] < numbers[end])
                {   
                        ++small;
                        if(small != index)
                        {   
                                Swap(&numbers[small],&numbers[index]);
                        }   
                }   

        }   
        ++small;
        Swap(&numbers[small],&numbers[end]);
        return small;
}
void quicksort(int numbers[],int start,int end,int length)
{
        if(start == end)
                return 
        int index = partiton(numbers,start,end,length);
        if(index > start)
                partition(numbers,start,index,length);
        if(index < end)
                partition(numbers,index + 1, end,length);
    
}