java中的冒泡排序算法

public static void bubblesort(int[] array) 
    {
    int temp;
    for(int i=0;i<array.length-1;i++)
    {
        for(int j=0;j<array.length-i-1;j++)
        {
            if(array[j+1]<array[j])
            {
                temp = array[j];
                array[j] = array[j+1];
                array[j+1] = temp;
            }
        }
    }
    }
    public static void main(String[] args) 
    {
    int[] array = {100,45,17,36,21,17,13,7};
    System.out.println("数组的长度:" + array.length);
    System.out.println("排序前的数组:"+Arrays.toString(array));
    bubblesort(array);
    System.out.println("排序后的数组:"+Arrays.toString(array));
    }
原文地址:https://www.cnblogs.com/suyun0702/p/12673419.html