一维数组的冒泡排序原理

public class ArrayDemo {
	public static void main(String args[]) {
		/*
		 *冒泡排序原理
		 *n个数至少进行n次比较
		 *每个数至少进行n-1次两两比较
		 */
		int data [] = new int [] {5,9,1,6,3,8,13,66,88,77};
		
		sort(data);
		print(data);
	}

	public static void sort(int arr[]) {
		for (int x = 0; x < arr.length; x++) {
			for (int y = 0; y < arr.length-1; y++) {
				if (arr[y] > arr[y+1]) {
					int t = arr[y];
					arr[y] = arr[y+1];
					arr[y+1] = t;
				}
			}
		}
	}

	public static void print(int arr[]) {
		for (int x = 0; x < arr.length; x++) {
			System.out.print(arr[x] + ",");
		}
		System.out.println();
	}
}