数据结构之选择排序
Java代码
import java.util.Scanner;
//选择排序
public class SelectionSort {
public static void selectionSort(int []A, int N){
int min;
int t;
for (int i = 0; i < N-1; i++) {
min = i;
for (int j = i; j < N; j++) {
if (A[j]<A[min]){
min = j;
}
}
t = A[i];A[i] = A[min];A[min] = t;
}
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int []A = new int[100];
int N;
N= scanner.nextInt();
for (int i = 0; i < N; i++) {
A[i] = scanner.nextInt();
}
selectionSort(A,N);
for (int i = 0; i <N ; i++) {
System.out.print(A[i]+ " ");
}
}
}
测试样例及输出