java學習之 陣列排序-選擇排序
阿新 • • 發佈:2018-12-02
package Day004;
public class arrayDemo {
public static void main(String [] args) {
System.out.println("跟陣列有關的demo");
int [] arrs = {16, 3, 18, 99, 86, 25, 4, 19};
System.out.println(arrs.length);
printArray(arrs);
selectArray(arrs);
System.out.println();
printArray(arrs);
}
private static void printArray(int [] arrs) {
for(short i = 0; i < arrs.length; i++)
System.out.print(arrs[i] + " \t");
return ;
}
private static void selectArray(int [] arrs) {
for(int i = 0; i < arrs.length; i++) {
for(int j = i+1; j < arrs.length; j++) {
if(arrs[i] < arrs[j])
swapArray(arrs,i, j);
}
}
return ;
}
private static void swapArray(int [] arrs, int i, int j) {
int tempValue;
tempValue = arrs[i];
arrs[i] = arrs[j];
arrs[j] = tempValue;
return;
}
}
public class arrayDemo {
public static void main(String [] args) {
System.out.println("跟陣列有關的demo");
int [] arrs = {16, 3, 18, 99, 86, 25, 4, 19};
System.out.println(arrs.length);
printArray(arrs);
selectArray(arrs);
System.out.println();
printArray(arrs);
private static void printArray(int [] arrs) {
for(short i = 0; i < arrs.length; i++)
System.out.print(arrs[i] + " \t");
return ;
}
private static void selectArray(int [] arrs) {
for(int i = 0; i < arrs.length; i++) {
for(int j = i+1; j < arrs.length; j++) {
swapArray(arrs,i, j);
}
}
return ;
}
private static void swapArray(int [] arrs, int i, int j) {
int tempValue;
tempValue = arrs[i];
arrs[i] = arrs[j];
arrs[j] = tempValue;
return;
}
}