快速排序

来源：互联网发布：qq软件功能编辑：程序博客网时间：2024/06/06 00:13
/*============================================================================ Name        : Exercise.cpp Author      : Haier Version     : 1.01 Copyright   : Copyright (c) 2014 Description : QuickSort in C, Ansi-style, Compile by Code:Block ============================================================================*/#include <stdio.h>#include <stdlib.h>int LookForPivot(int Array[],int Low,int High){int PivotValue=Array[Low];int Temp;while(Low<High){while(Low<High && Array[High]>=PivotValue){High--;}{Temp=Array[High];Array[High]=PivotValue;PivotValue=Temp;}while(Low<High && Array[Low]<=PivotValue){Low++;}{Temp=Array[Low];Array[Low]=PivotValue;PivotValue=Temp;}}return Low;}void QSort(int Array[],int Low,int High){int Pivot;    if(Low<High)    {        Pivot=LookForPivot(Array,Low,High);        QSort(Array,Low,Pivot-1);        QSort(Array,Pivot+1,High);    }}void QuickSort(int Array[],int size){QSort(Array,0,size-1);}int main(void) {int ArrayToSort[5]={2,3,1,5,4};int i;QuickSort(ArrayToSort,5);for(i=0; i<5; i++){printf("%d,",ArrayToSort[i]);}return EXIT_SUCCESS;}
0 0