快速排序

#include<stdio.h>int partition(int r[],int low, int high){ int pivot=r[low]; //枢轴元素 while(low < high) { while(low<high && r[high] > pivot) --high; //从右向左找第一个比枢轴小的元素 r[low] = r[high]; while(low <high && r[low] < pivot ) ++low; //从左向右找第一个比枢轴大的元素 r[high] = r[low]; } r[low]=pivot; return low;}void quick_sort(int r[],int low,int high)//快速排序{ int loc; if(low < high) { loc=partition(r,low,high); //分割 quick_sort(r,low,loc-1); //将两部分分别排序 quick_sort(r,loc+1,high); }}void main()//主函数{ int a[6]={2,10,5,16,8,4},i; printf(" before sort.../n"); for(i=0;i<5;i++) printf("%5d",a[i]); quick_sort(a,0,5); printf("/n after sort.../n"); for(i=0;i<5;i++) printf("%5d",a[i]); printf("/n");}