冒泡排序

#include<stdio.h>
#include<stdlib.h>

int main() {
	//一次冒泡过程模拟
	int a[10] = {8,5,9,6,453,7,73,2,11,32};
	for (int i = 0; i < 10-1; i++) {
		if (a[i] > a[i + 1]) {
			int temp = a[i];
			a[i] = a[i + 1];
			a[i + 1] = temp;
		}
		for (int i = 0; i < 10; i++) {
			printf("%5d", a[i]);
		}
		printf("\n");
	}

	//冒泡排序全过程模拟,一次循环都有一个元素沉底
	int a1[10] = {100,99,88,77,66,55,44,33,22,11};
	printf("------------------------------------------------------\n");
	for (int ii = 0; ii < 10; ii++) {
		printf("%5d", a1[ii]);
	}
	printf("\n>>\n");
	for (int i = 0; i <10-1 ; i++) {
		for (int j = 0; j < 10-1 - i; j++) {
			if (a1[j] > a1[j + 1]) {
				int temp = a1[j];
				a1[j] = a1[j + 1];
				a1[j + 1] = temp;
			}
		}
		for (int ii = 0; ii < 10; ii++) {
			printf("%5d", a1[ii]);
		}
		printf("\n");
	}
	for (int i = 0; i < 10; i++) {
		printf("%5d", a1[i]);
	}
	printf("\n");
	return 0;
}