Java经典冒泡排序
话不多说直接上代码
import java.util.Arrays;
public class a {
public static void bubbleSort(int[] arr){
for (int i = 0; i < arr.length - 1; i++) { //总共需要比较(n-1)趟
boolean sortedFlag = true;
for (int j = 0; j < arr.length - 1 - i; j++) { //每趟需要比较(n-i)次,1<=i<=n-1
if(arr[j]>arr[j+1]){
int t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
sortedFlag = false;
}
}
if(sortedFlag) break;
}
}
public static void main(String[] args) {
int b[]= {7,1,5,4,3,8,6,9,2};
a.bubbleSort(b);
System.out.println(Arrays.toString(b));
}
}