java算法

冒泡排序

    public class Test {    static int   number[] = new int [] {1,2,6,3,0,9,23,5,7};    public static void main(String[] args) {        numberSort(number);        System.out.println("-----------" + Arrays.toString(number));    }    public static void numberSort(int [] s){        int n = s.length;        for(int i = 0;i<n;i++){            for(int j =1;j<n-i;j++){                if(s[j-1]>s[j]){                    int temp = s[j-1];                    s[j-1] = s[j];                    s[j] = temp;                    System.out.println(s[j]);                }            }        }    }}