冒泡排序笔记

public class Test5 {
	//复习下冒泡排序
	public static void main(String[] args) {
		int list[] = new int[]{10,55,98,45,42,36,78,9};
		new Test5().max_min(list);
		System.out.println();
		new Test5().mim_max(list);
		
	}
	
	//从大到小排序
	public void max_min(int[] list) {
		for (int i = 0; i < list.length-1; i++) {
			for (int j = 0; j < list.length-1; j++) {
				if (list[j] < list[j+1]) {
					int num;
					num = list[j];
					list[j] =list[j+1];
					list[j+1] = num;
				}
			}
		}
		
		//结果
		for (int i = 0; i < list.length; i++) {
			System.out.print(list[i]+",");
		}
	}
	
	//从小到大排序
		public void mim_max(int[] list) {
			for (int i = 0; i < list.length-1; i++) {
				for (int j = 0; j < list.length-1; j++) {
					if (list[j] > list[j+1]) {
						int num;
						num = list[j];
						list[j] =list[j+1];
						list[j+1] = num;
					}
				}
			}
			
			//结果
			for (int i = 0; i < list.length; i++) {
				System.out.print(list[i]+",");
			}
		}

}