冒泡排序法，升序输出

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int main() {
	int i, j,t, a[10] = { 1,3,2,4,5,22,9,0,7,11 };
	for (i = 0; i < 10; i++) {
		for (j = 0; j < 10 - i - 1; j++) {
			if (a[j] > a[j + 1]) {
				t = a[j];
				a[j] = a[j + 1];
				a[j+1] =t;
			}
		}
	}
	for (i = 0; i < 10; i++)
		printf("%3d", a[i]);
	return 0;
}