冒泡排序

 

int[] arr = new int[] { 34, 5, 22, -98, 6, -76, 0, -3 };

arr(arr);
for (int a = 0; a < arr.length; a++) {
System.out.println(arr[a]);
}

 

public static void arrs(int[] arr) {

for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}

}