摘要: 1 /** 2 快速排序的原理: 3 左边的数比middle小 4 右边的数比middle大 5 **/ 6 # include 7 # include 8 void sort(int a[],int low,int high) 9 {10 int m = a[(low+h... 阅读全文
posted @ 2014-12-17 19:21 天天AC 阅读(241) 评论(0) 推荐(0)