最优冒泡排序，选择排序

// 冒泡排序
int [] arr = {10,5,6,7,4,8,43,1,0};
boolean flag;
for (int i = 0; i < arr.length; i++) {
	flag = false;
	for(int j = 0;j < arr.length - i -1; j++) {
		if(arr[j] < arr[j + 1]) {
			int temp = arr[j];
			arr[j] = arr[j + 1];
			arr[j + 1] = temp;
			flag = true;
		}
	}
	if(!flag) {
		break;
	}
}

// 选择排序
int index;
for (int i = 0; i < arr.length - 1; i++) {
	index = i;
	for (int j = i + 1; j < arr.length; j++) {
		if(arr[index] < arr[j]) {
			index = j;
		}
	}
	if(index != i) {
		int temp = arr[i];
		arr[i] = arr[index];
		arr[index] = temp;
	}
}

// 打印数组
for (int i : arr) {
	System.out.print(i + " ");
}