冒泡排序:依次拿 未對比排序過的 兩個相鄰的數對比,然後排序
選擇排序:依次拿 未對比排序過的 和後邊所有的數對比,然後排序
public static void main(String[] args) {
int[] myArray = {13,23,5,99,42,501,302,1,2,88};
System.out.println("排序前的數組爲:");
for(int i=0;i<myArray.length;i++) {
System.out.print(myArray[i]+" ");
}
//選擇排序 正序
for (int i=0;i<myArray.length;i++){
for (int j=i+1;j<myArray.length;j++){
if(myArray[i] > myArray[j]){
int temp = myArray[i];
myArray[i] = myArray[j];
myArray[j] = temp;
}
}
}
System.out.println();
System.out.println("選擇倒序 正序後:");
for(int i=0;i<myArray.length;i++) {
System.out.print(myArray[i]+" ");
}
//冒泡倒序 倒序
for (int i=0;i<myArray.length;i++){
for (int j=0;j<myArray.length-i-1;j++){
if(myArray[j] < myArray[j+1]){
int temp = myArray[j];
myArray[j] = myArray[j+1];
myArray[j+1] =temp;
}
}
}
System.out.println();
System.out.println("冒泡倒序 倒序後:");
for(int i=0;i<myArray.length;i++) {
System.out.print(myArray[i]+" ");
}
}