用冒泡也能过

许熠谦 · 发布于 2022-10-25 · 浏览 645 回复 2

include <stdio.h>

int main() {

int s[1002], n, t;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
	scanf("%d", &s[i]);
}
for (int j = 0; j < n - 1; j++) {
	for (int k = 0; k < n - 1 - j; k++) {
		if (s[k] > s[k + 1]) {
			t = s[k];
			s[k] = s[k + 1];
			s[k + 1] = t;
		}
	}
}
for (int l = 0; l < n; l++) {
	printf("%d ", s[l]);
}
return 0;

}

全部回复 共 2 条

  1. 用桶排也能

  2. 没人用sort?

发表回复