最高效的冒泡排序

阅读更多

package cn.quinn.wsitn.util;

public class Test {

	public static void main(String[] args) {

		int[] aa = new int[] { -2, 3, -55, 7, 6, 9, 66 };
		sort(aa);
		for (int a : aa)
			System.out.println(a);
	}

	public static void sort(int[] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = i; j < array.length; j++) {
				if (array[j] > array[i]) {
					array[i] = array[i] + array[j];
					array[j] = array[i] - array[j];
					array[i] = array[i] - array[j];
				}
			}
		}
	}

}