数组冒泡排序法

	public static void main(String[] args) {
		int[] arr = {24,69,80,57,13};
		System.out.println(arr.length);
		for (int i = 0; i < arr.length - 1 ; i++) {
			for (int j = 0; j < arr.length -1 -i ; j++) {
				if (arr[j]>arr[j+1]) {
					int temp = arr[j+1];
					arr[j+1] = arr[j];
					arr[j] = temp; 			
				}
			}

		}
		for (int i = 0; i < arr.length; i++) {
			System.out.println(arr[i]);
		}
		
	}