2021-05-07

《冒泡排序》手动输入数据

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

public class maopao {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        System.out.print("请输入要排序的个数：");
        int x = scanner.nextInt();
        int[] a = new int[x];

        System.out.println("请输入要排序的数：");
        for (int i = 0; i < x; i++) {
            a[i] = scanner.nextInt();
        }

        int[] sort = sort(a);
        System.out.println(Arrays.toString(sort));

    }

    //冒泡算法
    public static int[] sort(int[] array) {
        int temp = 0;
        for (int h = 0; h < array.length - 1; h++) {
            for (int j = 0; j < array.length - 1 - h; j++) {
                if (array[j] > array[j + 1]) {
                    temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
        return array;

    }
}