当前位置：网站首页>Bucket sorting ← C language implementation

Bucket sorting ← C language implementation

2022-04-21 10:44:00 【hnjzsyjyj】

【 The idea of bucket sorting 】

If the value to be sorted is in a limited range （ integer ） when , A finite number of ordered barrels can be designed , Bucket number is the value to be sorted .
after , Load the values to be sorted into the corresponding ordered bucket in turn （ Duplicate values are loaded into the corresponding bucket ）, then Output the value of each bucket in sequence , You get an ordered sequence .

【C The language code 】

#include <stdio.h>
#include <math.h>

const int maxn=500;
int t[maxn];

int main() {
	int n;
	scanf("%d",&n);

	int x; //x is less than maxn
	int i,j;
	for(i=1; i<=n; i++) {
		scanf("%d",&x);
		t[x]++;
	}

	for(j=1; j<=maxn; j++) {
		while(t[j]>0) {
			printf("%d ",j);
			t[j]--;
		}
	}
	return 0;
}


/*
in:
10
20 40 32 67 40 20 89 300 400 15

out:
15 20 20 32 40 40 67 89 300 400
*/

版权声明
本文为[hnjzsyjyj]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204211039133933.html

边栏推荐

猜你喜欢

随机推荐