冒泡排序和选择排序

/**
 * 冒泡排序
 * 
 */
	public static void main(String[] args) {
		int[] arr = { 12, 9, 23, 77, 6, 34 };
		
		Demo4.sort(arr);
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+" ");
		}
	}

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







/**
 * 选择排序
 * 
 */

public static void main(String[] args) {
		int[] arr = { 12, 9, 23, 77, 6, 34 };
		Demo3.sort(arr);
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]);
		}
	}

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