排序方法
package cn.org.test;


public class SortTest {
public static void main(String[] args) throws Exception {

int arrs[] = {49,27,65,98,0,12,348,45};
bubbleSort(arrs);

int arrs1[] = {49,27,65,98,0,12,348,45};
insertSort(arrs1);

int arrs2[] = {49,27,65,98,0,12,348,45};
selectSort(arrs2);

}


public static void bubbleSort(int[] arrs){

printf(arrs);

int n = arrs.length;
for(int i = 1; i < n ;i ++) {
for(int j = n -1 ;j >= i; j --) {
if(arrs[j] < arrs[j-1]) {
int temp = arrs[j];
arrs[j] = arrs[j-1];
arrs[j-1] = temp;
}
}
}

printf(arrs);

}


public static void insertSort(int[] arrs){

printf(arrs);
int j = 0;
int n = arrs.length;
for(int i = 1; i < n ;i ++) {
int temp = arrs[i];
for( j = i - 1 ;j >=0 && arrs[j] < temp ; j --) {
arrs[j + 1] = arrs[j];
}
arrs[j + 1] = temp;

}

printf(arrs);

}


public static void selectSort(int[] arrs) {

printf(arrs);

int n = arrs.length;
for(int i = 0; i < n ;i ++) {
for(int j = i + 1 ;j < n ; j ++) {
if(arrs[j] < arrs[i]) {
int temp = arrs[i];
arrs[i] = arrs[j];
arrs[j] = temp;
}
}
}

printf(arrs);
}

public static void printf(int[] arrs){
for(int i = 0; i < arrs.length;i++) {
System.out.print(arrs[i]);
System.out.print("\t");
}
System.out.println();
}


}