排序算法（交換排序）——快速排序

算法： int QuickValue(int a[] ,int low, int high) {int key = a[low];while(low < high){while(low < high && a[high] >= key){high--;}if (low != high){//交換int n1 = a[high];a[high] = a[low];a[low] = n1;print(

>>阅读原文<<