冒泡排序算法

/*Bobble sort*/
/* input int a[n] 
 *legel finish return 0*/

int bobblesort(int a[],int n){
/*input array a[],n the lenth of a[],*/
 int i=0,j=0;
 int temp=0;     //for exchange data
 int state=0;    //when exchanged set state=1

 for(i=n;i>0;--i){

  for(j=0;j<i-1;++j){
      if(b[j]<b[j+1])
   {
       temp=a[j];
       a[j]=a[j+1];
       a[j+1]=temp;
       state=1;
   }//if when a[j]<a[j+1] exchange a[j]/a[j+1],and set state=1
  }//for
  if (state==0) break;
  state=0;
  
 }

 return 0;

}