冒泡法排序---对含N个整数的数组a由小到大进行排序

#define N 10
#include "iostream"
using namespace std;
int main()
{
	int a[N],i,j,t;
	for(i=0;ia[j+1])
			{
				t=a[j];
				a[j]=a[j+1];
				a[j+1]=t;
			}
			cout<<"\nafter sort:\n";
			for(i=0;i