快速排序算法比较简单的写法

快速排序算法比较简单的写法

左为基准

int QuickSort(int *asArray, int aiLow, int aiHigh)//left { int liLeft = aiLow; int liRight = aiHigh; int liPivot = asArray[liLeft]; if(liLeft <liRight) { while(liLeft < liRight) { while(asArray[liRight] >= liPivot&&liLeft <liRight) --liRight; asArray[liLeft] = asArray[liRight]; while(asArray[liLeft] <=liPivot&&liLeft<liRight) ++liLeft; asArray[liRight] = asArray[liLeft]; } asArray[liLeft] = liPivot; QuickSort(asArray, aiLow, liLeft-1); QuickSort(asArray, liLeft+1, aiHigh); } return 0; }

右为基准

int QuickSort2(int *asArray, int aiLow, int aiHigh)//Right { int liLeft = aiLow; int liRight = aiHigh; int liPivot = asArray[liRight]; if(liLeft < liRight) { while(liLeft < liRight) { while(asArray[liLeft] <=liPivot&&liLeft<liRight) ++liLeft; asArray[liRight] = asArray[liLeft]; while(asArray[liRight] >= liPivot&&liLeft <liRight) --liRight; asArray[liLeft] = asArray[liRight]; } asArray[liRight] = liPivot; QuickSort(asArray, aiLow, liLeft-1); QuickSort(asArray, liLeft+1, aiHigh); } return 0; }