bubbleSort

时间复杂度 O(n^2)，最好为O(n)
空间复杂度O(1)

package Sorts;

public class bubbleSort {

    public static void bubbleSort(int[] numbers){
        int temp = 0;
        int size = numbers.length;
        for(int i=0;i<size-1;i++){
            for(int j=0;j<size-1-i;j++){
                if (numbers[j]>numbers[j+1]){
                    temp = numbers[j];
                    numbers[j] = numbers[j+1];
                    numbers[j+1] = temp;
                }
            }
        }
    }

}