7.排序第四类:归并排序-二路归并排序
将n个元素分成个含n/2个元素的子序列,对两个子序列重复划分,直至子序列仅含一个元素,重复进行排序并合并两个已排序的子序列
#include <cstdio>
#include <algorithm>
using namespace std;
int a[200005], n, b[200005];
void guibing(int l,int r){
if(l == r) return;
int mid = (l+r)/2;
guibing(l, mid);
guibing(mid+1, r);
int x = l;
int y = mid+1;
for(int i = 0; i < r-l+1; i++){
if(x == mid+1){
b[i]=a[y++];
continue;
}
if(y == r+1){
b[i]=a[x++];
continue;
}
if(a[x] < a[y]) b[i] = a[x++];
else b[i] = a[y++];
}
for(int i = 0; i < r-l+1; i++) a[l+i] = b[i];
}
int main(int argc, char const *argv[]) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
guibing(0, n-1);
for (int i = 0; i < n; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}
8.排序第五类:基数排序
将整数按位数切割成不同的数字,然后按每个位数分别比较,首先根据个位数的数值,分配编号0到9;重复根据下一位数字分配,最后将数值重新串接起来
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int a[500005], n, b[500005];
void jishu(int n) {
int num[10];
int k, h = 1, x = 1, y = 10;
for(int i = 0; i < n; i++) {
while(a[i] >= y) {
y *= 10;
x++;
}
}
for(int i = 1; i <= x; i++) {
memset(num, 0, sizeof(num));
for(int j = 0; j < n; j++) {
k = (a[j]/h) % 10;
num[k]++;
}
for(int i = 1; i < 10; i++) num[i] += num[i-1];
for(int i = n-1; i >= 0; i--) {
k = (a[i]/h) % 10;
b[num[k]-1] = a[i];
num[k]--;
}
for(int i = 0; i < n; i++) a[i] = b[i];
h *= 10;
}
}
int main(int argc, char const *argv[]) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
jishu(n);
for (int i = 0; i < n; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}
9.排序第六类:桶排序
声明一个长度为数据最大值+1的数组,j将元素对应的数组下标值加 1,最后输出数组的下标,数组每个位置的值为几就输出几次下标
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int a[500005], n;
void Tong() {
int m = *max_element(a, a+n) + 1;
//printf("%d\n", m);
int b[m];
memset(b, 0, sizeof(b));
for(int i = 0; i < n; i++) b[a[i]]++;
for(int i = 0, j = 0; i < m; i++) {
while(b[i]!=0) {
a[j++]=i;
b[i]--;
}
}
}
int main(int argc, char const *argv[]) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
Tong();
for (int i = 0; i < n; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}