简易冒泡排序

#include<stdio.h>

int main()
{
	int a[] = { 23,4,7,3,9,1,0 };
	int n = 7,temp;
	for(int i =1;i<n;i++)
		for (int j = 0; j < n - i; j++) {
			if (a[j] > a[j + 1]) {
				temp = a[j + 1];
				a[j + 1] = a[j];
				a[j] = temp;
			}
		}
	for (int i = 0; i < n; i++)
		printf("%d ", a[i]);
	return 0;
}