简单算法之冒泡排序

package test;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("---------找出N个数中的最大值--------");
        System.out.println("请输入N的值：");

        int n = sc.nextInt();
        //定义数组大小
        int[] array = new int[n];
        for(int i = 1 ; i <= n; i++){
            System.out.println("请输入第"+i+"个数字：");
            //循环添加数组的值，数组从0开始
            array[i-1] = sc.nextInt();
        }
        System.out.print("您输入的数组为：");
        for(int s = 0;s<array.length;s++)
            System.out.print(array[s]+" ");
        System.out.println("----------请输入任意数字后回车进行查找：");
        int ok = sc.nextInt();
        System.out.println("输入结束，正在进行查找:");
        System.out.println("----------");

        for(int i=1;i<array.length;i++){
            for (int j=0;j<array.length-i;j++){
                if(array[j]>array[j+1]){
                    int temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                }
            }
        }
        System.out.println("最小值为："+array[0]+"；最大值为："+array[n-1]);
    }
}