(存)冒泡法 java

  

冒泡排序算法java

解答：

package parent.career.blest;

 

/**

 * 冒泡排序算法演示 : 从小到大排列数组元素

 * 原理：第一个元素和后面的一个元素比较，比较结果再和后面一个元素比较，依次类推

 *       接着，第二个和后面元素比较，依次类推

 */

public class Maopao{

         public static int[] mppx(int[] array){

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

                            for(int j=i; j<array.length; j++){

                                     int temp;

                                     if(array[i]>array[j]){

                                               temp = array[i];

                                               array[i] = array[j];    

                                               array[j] = temp;

                                     }

                            }      

                   }

                   return array;

         }

         public static void main(String args[]){

                   // 测试

                   int[] ar ={12,23,1,23,45,11,42,9,45,2,16,77,86,56,43};    

                   ar = mppx(ar);

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

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

                   }      

         }      

}