#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int n;
int q[N];
void quick_sort(int q[], int l, int r) {
if (l >= r) return;
int x = (l + r) / 2, i = l - 1, j = r + 1;
while (i <j) {
do { i++; } while (q[i] < q[x]);
do { j--; } while (q[j] > q[x]);
if (i < j) swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j+1, r);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &q[i]);
}
quick_sort(q, 0, n - 1);
for (int i = 0; i < n; i++) {
printf("%d ", q[i]);
}
return 0;
}
PART2:归并排序
2.1 中心思想
1.确定区间的中点,将区间划分为两部分left and right;
2.递归两部分区间,直至变为长度为1的单个数字;
3.归并—指针i指向left第一个数字,指针j指向right第一个数字,比较大小。
4.暂存temp数组,将temp返回给原数组;
2.2代码实现
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int q[N], temp[N];
void merge_Sort(int q[], int l, int r) {
if (l >= r) return;
int mid = (l + r) / 2;
merge_Sort(q, l, mid);
merge_Sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
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];
}
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &q[i]);
}
merge_Sort(q, 0, n - 1);
for (int i = 0; i < n; i++) {
printf("%d ", q[i]);
}
return 0;
}