2021-04-10

冒泡排序代码

package Day01;

import java.util.Arrays;

public class Dau01_02 {
public static void main(String[] args) {
int [] arrays ={3,4,6,5,9,7,10};
sort(arrays);
System.out.println(Arrays.toString(arrays));

}
public static void sort(int[] array){
    int term =0;
    for(int i=0;i<array.length;i++){
        for(int j=0;j<array.length-1-i;j++){
            if(array[j]>array[j+1]){
                term =array[j];
                array[j]=array[j+1];
                array[j+1]=term;
            }
        }

    }

}

}