import java.util.Arrays;
public class ArraySort{
public static void main(String[] args){
int[] array = new int[]{1,3,5,7,2,9,8,4,6};
冒泡排序
for(int i = 0 ; i<array.length; i++ ){
for(int j = 0; j <array.length-1-i; j++){
if(array[j] > array[j+1]){
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
//选择排序
for(int i = 0; i<array.length;i++){
int index = i;
for(int j = i; j<array.length ; j++){
if(array[j] < array[index]){
index = j;
}
}
交换位置,交换假定最小的和真实最小的位置
int temp = array[index];
array[index] = array[i];
array[i] = temp;
}
Arrays.sort(array);
遍历数组
for(int i = 0;i<array.length; i++){
System.out.print(array[i] + "\t");
}
}
}