冒泡排序

#include<iostream>
using namespace std;
int main()
{
	int a[10],i,j,temp;
	for(i = 0; i<10;i++)
		cin>>a[i];
	for(i = 0;i<10-1;i++)
	{

		for(j = 0;j<10-1-i;j++)
			if(a[j]>a[j+1])
			{
				temp = a[j];
				a[j] = a[j+1];
				a[j+1] = temp;

			}
	}
	cout<<"After  sorting"<<endl;
	for(i = 0;i<10;i++)
		cout << a[i] <<" ";
	cout << endl;
	system("pause");
	return 0;
}