冒泡排序

    技术2022-07-11  79

    冒泡排序

    public class Test{ public static void main(String[] args){ int[] arr = {20,5,15,10,0,25}; int temp = 0; for (int j=0;j<arr.length-1;j++ ){ for (int i=0;i < arr.length-1-i ;i++ ){ if (arr [i] > arr [i+1]){ temp = arr [i+1]; arr [i+1] = arr [i]; arr [i] = temp; } } for( int k = 0; k < arr.length; k++) { System.out.print(arr[k] + "\t"); } System.out.println("进行第"+(j+1)+"轮排序"); } } }
    Processed: 0.011, SQL: 9