public class Test {
public static void main(String[] args) {
// 冒泡排序优化版,通过标志位,解决时间复杂度的问题
int[] array = {9,3,5,8,7,3,9,5,3,7,4,1,2};
boolean flag = true;
int n = array.length;
while(flag){
flag = false;
for (int i = 0; i < n-1 ; i++) {
if (array[i]<array[i+1]){
int temp = array[i];
array[i] = array[i+1];
array[i+1]= temp;
flag = true;
}
}
n--;
}
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]);
}
}
}