#include<iostream>
#include<iomanip>
using namespace std;
void BubSort(int r[],int n)
{
int i,j,t;
int flag;//flag=0 means no sorting;otherwise sorting
for(i=n-1;i>0;i--)
{
flag=1;
for(j=0;j<i;j++)
if(r[j]>r[j+1])
{
t=r[j+1];
r[j+1]=r[j];
r[j]=t;
flag=0;
}
if(flag) break;
}
}
void Print(int r[],int n)
{
for(int i=0;i<n;i++)
cout<<setw(5)<<r[i]<<",";
cout<<endl;
}
int main()
{
int s[11]={5,1,7,3,1,6,9,4,2,8,6};
cout<<"before sorting:\n";
Print(s,11);
BubSort(s,11);
cout<<"after sorting:\n";
Print(s,11);
return 0;
}