java冒泡排序,选择排序,插入排序

冒泡排序,选择排序,插入排序

public class Demo02 {
	public static void main(String[] args) {
		int [] arrs = {12,56,76,34,86,24,11,89,11,27};
		//maoPao(arrs);
		//xuanZe(arrs);
		chaRu(arrs);
	}
	//冒泡排序
	public static void maoPao(int [] arrs) {
		int num = 0;
		for (int i = 0; i < arrs.length - 1; i++) {
			for (int j = 0; j < arrs.length - 1 - i; j++) {
				if(arrs[j] > arrs[j+1]){
					num = arrs[j+1];
					arrs[j+1] = arrs[j];
					arrs[j] = num;
				}
			}
		}
		for (int i : arrs) {
			System.out.print(i+",");
		}
	}  
	//选择排序
	public static void xuanZe(int [] arrs) {
		int num = 0;
		for (int i = 0; i < arrs.length - 1; i++) {
			for (int j = i+1; j < arrs.length ; j++) {
				if(arrs[i] > arrs[j]){
					num = arrs[j];
					arrs[j] = arrs[i];
					arrs[i] = num;
				}
			}
		}
		for (int i : arrs) {
			System.out.print(i+",");
		}
	}
	//插入排序
	public static void chaRu(int [] arrs) {
		int num = 0;
		for (int i = 1; i < arrs.length ; i++) {
			for (int j = 0; j < i; j++) {
				if(arrs[i] < arrs[j]){
					num = arrs[j];
					arrs[j] = arrs[i];
					arrs[i] = num;
				}
			}
		}
		for (int i : arrs) {
			System.out.print(i+",");
		}
	}
}