int i,j,t=0;for(i=0;i<len-1;i+) for(j=0;j&len-i-1;j+) if(flag=0) if(aj>aj+1) t=aj; aj=aj+1; aj+1=t; else /查找排序 void FindSort(int int i,j,t;len;for(j=i+1; if(ai&aj) t=ai; ai=aj; aj=t; /快速排序 void QuickSort(int a, int left, int right) int mid, mid1, l, r, temp; l=left; r=right; mid1=(left + right)/2; mid=amid1; while(l&r) while(al & mid) +l; while(ar & -r; if(l&r) break; temp = al; al = ar; ar = temp; if(l!= mid1) if(r != mid1) if(l = r) l+; if(left & r) qsort(a, left, l-1); if(l & right) qsort(a, r+1, right);