选择排序和冒泡排序

选择排序：

package com.lanqiao.facetest;

public class SelectSqu {
	public static void main(String[] args) {
		int array[] = {10,51,23,51,15,62,52,89,100};
		select(array);
		for(int a=0;a<array.length;a++){
			System.out.print(array[a]+"    ");
		}
	}
	public static void select(int[] array){
		for(int i=0;i<array.length-1;i++){
			int k=i;
			for(int j=i;j<array.length;j++){
				//每遍历一次拿到一个最小值
				if(array[k]>array[j]){
					k=j;
				}
			}
			if(k!=i){
				int temp = array[i];
				array[i] = array[k];
				array[k] = temp;
			}
		}
	}
}

冒泡排序：

package com.lanqiao.facetest;

public class Upsqu {
	public static void main(String[] args) {
		int array[] = {10,51,23,51,15,62,52,89,100};
		select(array);
		for(int a=0;a<array.length;a++){
			System.out.print(array[a]+"    ");
		}
	}
	public static void select(int array[]){
		for (int i = 0; i < array.length-1; i++) {
			for (int j = i; j < array.length-i-1; j++) {
				if(array[i]>array[j]){
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
	}
}