**********************冒泡排序下沉法*********************
int[] array = {18,25,7,36,13,2,89,63};
System.out.println("冒泡排序下沉法原序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}
for ( int i = 0; i < array.length; i++ ) {
for ( int j = 0; j < array.length-i-1; j++ ) {
if ( array[j] > array[j+1] ) {
int t = array[j];
array[j] = array[j+1];
array[j+1] = t;
}
}
}
System.out.println("\n从小到大排序后序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}
**********************冒泡排序上浮法*********************
int[] array = {18,25,7,36,13,2,89,63};
System.out.println("冒泡排序上浮法原序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}
for ( int i = 0; i < array.length - 1; i++ ) {
for ( int j = array.length-2; j >= i; j-- ) {
if ( array[j] > array[j+1] ) {
int t = array[j];
array[j] = array[j+1];
array[j+1] = t;
}
}
}
System.out.println("\n从小到大排序后序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}
*************************选择排序*********************
int[] array = {18,25,7,36,13,2,89,63};
System.out.println("选择排序原序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}
for ( int i = 0; i < array.length - 1; i++ ) {
int k = i;
for ( int j = i+1; j < array.length; j++ ) {
if ( array[k] > array[j] ) {
k = j;
}
}
if ( k != i ) {
int t = array[i];
array[i] = array[k];
array[k] = t;
}
}
System.out.println("\n从小到大排序后序列:");
for ( int i : array ) {
System.out.print(i+"\t");
}