冒泡排序的简单使用

package seven;


import java.util.Arrays;
import java.util.Scanner;

//冒泡排序
public class Demo01 {
    public static void main(String[] args) {
//        double[] a={1,2,3,4,5523,6536,6634,7435};
//        double[] sort = sort(a);
//        System.out.println(Arrays.toString(sort));
        //使用scanner方法，输入一组数据，存入数组，并进行冒泡排序
        double[] array = array();
        double[] sort = sort(array);
        System.out.println(Arrays.toString(sort));
    }
    //定义一个方法,返回一个整型数组
    public static double[] sort(double array[]){
        //定义一个中转站
        double temp;
        //length-1-i，-1是防止他溢出，-i是因为他每经过一次循环，就能选出一个数，
        for (int i = 0; i < array.length-1-i; i++) {
            for (int j = 0; j < array.length - 1; j++) {
                if (array[j+1]<array[j]){//降序，升序改成==>array[j+1]>array[j]
                    temp=array[j+1];
                    array[j+1]=array[j];
                    array[j]=temp;
                    f=true;
                }
            }
        }
        return array;
    }
    public static double[] array(){
        double[] doubles=new double[10];
        Scanner scanner=new Scanner(System.in);
        if (scanner.hasNextDouble()){
            for (int i = 0; i < doubles.length; i++) {
                double v = scanner.nextDouble();
                doubles[i]=v;
            }
        }
        scanner.close();
        return doubles;
    }
}