简单的选择排序

package com.hp.io;

import java.util.Scanner;

public class XuanZe {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("请输入数组的个数");
        int a = s.nextInt();
        int[] b = new int[a];
        System.out.println("输入数组中的元素：");
        for (int i = 0; i < b.length; i++) {      //数组中的元素进行操作后都要遍历
            b[i] = s.nextInt();
        }
        for (int i = 0; i < b.length - 1; i++) {
            for (int j = i + 1; j < b.length; j++) {
                if (b[i] > b[j]) {
                    int temp = b[i];
                    b[i] = b[j];
                    b[j] = temp;
                }
            }
        }
        for (int k = 0; k < b.length; k++) {
            System.out.println(b[k] + " ");
        }
    }
}

package com.hp.io;

import java.util.Scanner;

public class MaoPao {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("请输入数组的个数");
        int a = s.nextInt();
        int[] b = new int[a];
        System.out.println("输入数组中的元素："); //对数组中元素进行遍历
        for (int i = 0; i < b.length; i++) {
            b[i] = s.nextInt();   //数组b的元素就是输入的元素
        }
        for (int i = 0; i < b.length - 1; i++) {
            for (int j = i + 1; j < b.length; j++) {
                if (b[i] > b[j]) {
                    int temp = b[i]; 
                    b[i] = b[j];
                    b[j] = temp;
                }
            }
        }
        for (int k = 0; k < b.length; k++) {   //打印的时候还还要求数组进行遍历
            System.out.println(b[k] + " ");
        }
    }