Algorithmic Learning (Java language description)--Simple selection sort __ Encoding

Simple Selection sort is to select the smallest key record from the n-i+1 record and exchange it with the first (1<=i<=n) record, by comparing the N-i key.

The implementation code is given below:

private static void Selectionsort (int a[]) {
	int temp, min;
	for (int i=0;i<a.length;i++) {
		min = i;		<span style= "White-space:pre" >		</span>//Sets the current subscript to the minimum subscript for
		(int j=min+1;j<a.length;j++) {
			if (A[j]<a[min]) {	<span style= "White-space:pre" >	</span>//if the latter value is less than the minimum value		
				min = j;		Assigns the subscript of the minimum value to min
			}
			
			//If the current minimum subscript is not equal to I, the minimum value is found, and the Exchange
			if (min!=i) {	
				temp=a[min];
				A[min]=a[i];
				A[i]=temp}}}}
  

Test code:

public static void Main (String args[]) {
		int a[] =  new int[]{5, 3, 4, 6, 2};
		Selectionsort (a);
		
		for (int i=0;i<a.length;i++) {
			System.out.print (a[i]+ "");
		}
		System.out.println ();		
	}

Test results: