冒泡排序-java

冒泡排序---java
package xuxiaofei.java.arrays;

import java.util.Scanner;

public class BubbleSort {
    public static void main(String[] args) {
        int[] number = new int[5];
//        保存输入的数
        for (int i = 0; i < number.length; i++) {
            Scanner src = new Scanner(System.in);
            System.out.println("请输入你要比较的" + (i + 1) + "数：");
            number[i] = src.nextInt();
        }
//        打印出输入的数
        System.out.print("原数是：");
        for (int i = 0; i < number.length; i++) {
            System.out.print(number[i] + "  ");
        }
//        冒泡排列数 由小到大 并把排序好的 数 保存在数组里
        for (int i = 0; i < number.length - 1; i++) {
            int temp;
            for (int j = 0; j < number.length - (i + 1); j++) {
                if (number[j] > number[j + 1]) {
                    temp = number[j];
                    number[j] = number[j + 1];
                    number[j + 1] = temp;
                }
            }
        }
//        打印出保存在 数组里已经排序好的数
        System.out.print("比较以后数排列为：");
        for (int i = 0; i < number.length; i++) {
            System.out.print(number[i] + " ");
        }
    }
}