排序与查找实例（二）：冒泡排序

    基础排序算法冒泡排序，原理就不介绍了，直接上代码。

/**  

*@Title: BuddleSort.java

*@Package sortandsearch

*@Description: TODO

*@author peidong 

*@date 2017-6-16 上午10:19:04

*@version V1.0  

*/

packagesortandsearch;

 

/**

 * @ClassName: BuddleSort

 * @Description: 冒泡排序

 * @date 2017-6-16 上午10:19:04

 * 

 */

publicclass BuddleSort {

 

       /**

        *

       * @Title: main

       * @Description: 测试用例

       * @param args

       * @return void   

       * @throws

        */

       public static void main(String[] args) {

              // TODO Auto-generated method stub

        int[]testArray={1,3,5,2,4,6,8,9,12,34,24,53};

        bubbleSort(testArray);

       }

      

       /**

        *

       * @Title: bubbleSort

       * @Description: 冒泡排序

       * @param a

       * @return void   

       * @throws

        */

       public static void bubbleSort(int[] a){

              int temp=0;

              for(int i=0;i<a.length-1;i++){

                     for(intj=0;j<a.length-i-1;j++){

                            if(a[j]>a[j+1]){

                                   temp=a[j];

                                   a[j]=a[j+1];

                                   a[j+1]=temp;

                            }

                     }

              }

              for(int i=0;i<a.length;i++){

                     System.out.print(a[i] +" ");

              }

       }

}