伪代码:::
Alorithm select(A,n): for i->0 to n-1 do for j ->i+1 to n-1 do if A[j] < A[i] then swap A[i] and A[j]
算法思想,每次取最小的那个值,与未排序的序列中最靠前的那个值互换位置。
java代码:
//简单选择排序 //时间复杂度O(n^2) public class select { int[] select(int[] A, int n){ for (int i = 0;i < n; i++){ for(int j = i+1;j < n;j++){ if(A[j] < A[i]){ int temp = A[i]; A[i] = A[j]; A[j] = temp; } } } return A; } void print(int A[],int n){ int[] B = select(A,n); for (int i = 0;i < n;i ++){ System.out.print(B[i]+","); } } }