- package methodOfSort;
- import java.util.Scanner;
- public class Chose {
- /*
- * 选择排序!
- */
- public static void main(String[] args) {
- // TODO Auto-generated method stub
- Scanner input = new Scanner(System.in);
- System.out.print("请输入数组长度?");
- int length = input.nextInt();
- int num[] = new int[length];
- for (int i = 0; i < num.length; i++) {
- System.out.print("请输入第" + (i + 1) + "个数的大小");
- num[i] = input.nextInt();
- }
- //* 数组初始排列顺序!
- System.out.println("数组初始排列顺序!");
- for (int i = 0; i < num.length; i++) {
- System.out.print(num[i] + " ");
- }
- /*
- * 选择排序!
- *
- * 从数组中选择最小的同第一个值交换,再从剩下的部分中
- * 选择最小的与第二个交换!
- */
- int min = 0;
- int k;
- int temp;
- for (int i = 0; i < num.length - 1; i++) {
- min = num[i];
- k = 0;
- for (int j = i + 1; j < num.length; j++) {
- if (num[j] < min) {
- min = num[j];
- k = j;
- }
- }
- if (k != 0) {
- temp = num[k];
- num[k] = num[i];
- num[i] = temp;
- }
- }
- //数组选择排序后重新顺序!
- System.out.println("\n选择后输出!");
- for (int i = 0; i < num.length; i++) {
- System.out.print(num[i] + " ");
- }
- }
- }