冒泡排序进阶版

package javaDemo.java;

import java.util.Scanner;

public class Maopao {
	public static void main(String[] args) {
		int[] arr = new int[6];
		for (int i = 0; i <=arr.length - 1; i++) {
			System.out.println("请输入第" + (i + 1) + "个数");
			Scanner sc = new Scanner(System.in);
			int d = sc.nextInt();
			arr[i] = d;
		}
		System.out.println(arr[4]);
		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 a = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = a;

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

		}
	}

}