冒泡排序算法

/**
* 冒泡排序
* @author Administrator
*
*/
public class BubbleSort {

  void bubbleSort(int[] a){
 
int len=a.length;
          //每个都进行冒泡(一个一个来)
         for (int i=0; i<len; i++){
                 //和后面的每个都进行比较(过五关看六将)
                  for (int j=len-2; j>=0; j--){  
                         if (a[j]>a[j+1]){
                        int temp = a[j];
                                 a[j] = a[j+1];
                                  a[j+1] = temp;
                         }
                  }
         }
  }

/**
* @param args
*/
public static void main(String[] args) {
BubbleSort bubbleSort=new BubbleSort();
int[] a={3,2,6,9,7,1,4,5};
bubbleSort.bubbleSort(a);

for(int i:a){
System.out.println(i);
}

}

}