[Java] Java implementation of selection sort

Brief

Selection sort is a simple sorting algorithm, which processes are as follows:
① find the smallest array element
② the first element of the array and its exchange
③ find the smallest element in the rest of the element
④ it and arrays a second switching element for
the next and so forth, until the entire array are ordered

example

Next we look at a specific example:
using the selected sorting array {S, O, R, T , E, X, A, M, P, L, E} ordered
Tips: i indicates the sort min represents the minimum number of index elements
I min. 1 0 2. 3. 4. 5. 6. 7. 8. 9 10
　　　　　　S O R & lt T a M P L E E X-
0. 6 X-S O R & lt T E　a　M P L E
. 1. 4　　Ａ　Ｏ　Ｒ　Ｔ　Ｅ　Ｘ　Ｓ　Ｍ　Ｐ　Ｌ　Ｅ
２　　１０　A E　Ｒ　Ｔ　Ｏ　Ｘ　Ｓ　Ｍ　Ｐ　Ｌ　Ｅ
３　　９　　A And E　Ｔ　Ｏ　Ｘ　Ｓ　Ｍ　Ｐ　Ｌ　Ｒ
４　　７　　A And E L　Ｏ　Ｘ　Ｓ　Ｍ　Ｐ　Ｔ　Ｒ
５　　７　　Ａ　Ｅ　Ｅ　Ｌ　Ｍ　Ｘ　Ｓ　Ｏ　Ｐ　Ｔ　Ｒ
６　　８　　A E L E M O　Ｓ　Ｘ　Ｐ　Ｔ　Ｒ
７　　１０　Ａ　Ｅ　Ｅ　Ｌ　Ｍ　Ｏ　Ｐ　Ｘ　Ｓ　Ｔ　Ｒ
８　　８　　Ａ　Ｅ　Ｅ　Ｌ　Ｍ　Ｏ　Ｐ　Ｒ　Ｓ　Ｔ　Ｘ
９　　９　　Ａ　Ｅ　Ｅ　Ｌ　Ｍ　Ｏ　Ｐ　Ｒ　Ｓ　Ｔ　Ｘ
１０　１０　Ａ　Ｅ　Ｅ　Ｌ　Ｍ　Ｏ　Ｐ　Ｒ　Ｓ　Ｔ　X-
---------------------------
sorting is done: A E E L M O P R S T X

Code Display

package Sort;

import java.util.*;

public class Selection_Sort {
	//选择排序
	public static void sort(Comparable[] a) {
		int N = a.length;
		for (int i = 0; i < N; i++) {
			//将a[i]和a[i+1]到a[N]中的最小元素作交换
			int min = i;
			for (int j = i+1; j<N; j++) {
				if ( a[j].compareTo(a[min]) < 0 )//如果a[j]<a[min]
					min = j;
			}
			//将a[i]和a[min]调换位置
			Comparable t = a[i];
			a[i] = a[min];
			a[min] = t;
		}
	}
	
	//用于打印展示数组的方法
	private static void show(Comparable[] a) {
		for (int i = 0; i<a.length; i++)
			System.out.print(a[i]+" ");
		System.out.println();
	}
	
	//用例
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		String in = reader.nextLine();
		String[] a = in.split(" ");
		sort(a);//调用上面的选择排序方法
		show(a);
	}
}

Input output
Input:
2,233,441,166,558,877
output:
1,122,334,455,667,788

Sort success!