排序算法

1、冒泡排序（BubbleSort()）

package com.gk.array2;

import java.util.Arrays;

/**
 * 测试冒泡排序以及优化
 * @author 康哥
 *
 */
public class TestBubbleSort {
	public static void main(String[] args) {
		int[] arrays = {22,13,3,6,7,9,44,67,88,10};
		//冒泡排序(未优化)
		for(int i = 0; i < arrays.length-1; i++) {
			for(int j = 0; j < arrays.length-1-i; j++) {
				int temp;
				if(arrays[j] > arrays[j+1]) {
					temp = arrays[j];
					arrays[j] = arrays[j+1];
					arrays[j+1] = temp;
				}
				System.out.println(Arrays.toString(arrays));
			}
			System.out.println("----------------------");
		}
		

		//冒泡排序(优化过的)
		for(int i = 0; i < arrays.length-1; i++) {
			boolean flag = true;
			for(int j = 0; j < arrays.length-1-i; j++) {
				int temp;
				if(arrays[j] > arrays[j+1]) {
					temp = arrays[j];
					arrays[j] = arrays[j+1];
					arrays[j+1] = temp;
					flag = false;
				}
				System.out.println(Arrays.toString(arrays));
			}
			
			if(flag) {
				System.out.println("排好了，结束!");
				break;
			}
			System.out.println("----------------------");
		}	
	}
}