随笔分类 - 算法学习
摘要：void merge_sort(int q[],int l,int r){ if(l >= r) return ; int mid = l + r >> 1; merge_sort(q,l,mid); merge_sort(q,mid+1,r); int k = 0,i = l,j = mid +
阅读全文
摘要：void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l ]; while (i < j) { do i ++ ; while (q[i] < x); do j -- ;
阅读全文
