今天回顾了一下自己所学的算法知识,不出我所料全都忘完了,可能要从头复习了,发篇文章记录一下,便于加深印象,也方便自己以后查找
//快速排序
void quick_sort(int q[], int l, int r) {
if (l >= r) return;
int x = q[l + r >> 1], i = l - 1, j = r + 1;
while (i < j) {
do i ++; while (q[i] < x);
do j --; while (q[j] > x);
if (i < j) swap(q[i], q[j]);
quick_sort(q, l, j);
quick_sort(q, j + 1, r);
}
}
//归并排序
int temp[N];//定义一个临时数组
void merge_sort(int q[], int l, int r) {
if (l >= r) return;
int mid = l + r >> 1, i = l, j = mid + 1;
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
int k = 0;
while (i <= mid && j <= r) {
if (q[i] <= q[j]) temp[k++] = q[i++];
else temp[k++] = q[j++];
}
while (i <= mid) temp[k++] = q[i++];
while (j <= r) temp[k++] = q[j++];
for (int i = l, j = 0; i <= r; i ++, j ++) q[i] = temp[j];
}