排序算法1——冒泡排序

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

package com.demo02;   import java.util.Arrays;   /**  * 冒泡排序  */ public class BubbleSort {     public static void main(String[] args) {         int[] arr=new int[]{4,123,213,21,3241,3231,32,3221,1};         bubbleSort(arr);         System.out.println(Arrays.toString(arr));     }           public static void bubbleSort(int[] arrary){         //控制比较多少轮         for (int i = 0; i < arrary.length-1; i++) {             for (int j = 0; j < arrary.length-1-i; j++) {                 if (arrary[j]>=arrary[j+1]){                     int temp=arrary[j];                     arrary[j]=arrary[j+1];                     arrary[j+1]=temp;                 }             }         }     } }

　　双层循环 第一次循环控制比较轮数 第二次循环控制比较次数

　　轮数为 数组大小-1