冒泡排序

public static void main(String[] args) {
int[] a = {33, 65, 9, 8, 7, -5, 6, -1};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}

public static int[] sort(int[] array){
    int temp = 0;

//外部循环
for (int i = 0; i < array.length-1; i++) {
//内部循环
for (int j = 0; j < array.length-1-i; j++) {
if (array[j]>array[j+1]){
temp = array[j+1];
array[j+1] = array[j];
array[j] = temp;
}

        }
    }
    return array;