JAVA簡單排序

遞歸：

public class kS {

public static void SelectSort(int a[],int n,int i){

int tmp,k;

if(i == n-1) return;

else{

k = i;

for(int j=i+1;j<n;j++){

if(a[j]<a[k]){

k=j;

}

}

if(k!=i){

tmp = a[i];

a[i] = a[k];

a[k] = tmp;

}

SelectSort(a,n,i+1);

}

}

public static void disp(int a[],int n){

for(int i=0;i<n;i++){

System.out.printf("%2d",a[i]);

}

System.out.println();

}

public static void main(String[] args) {

int n = 10;

int []a = {2,4,6,3,5,9,1,7,8,0};

System.out.println("排序前：");

disp(a,n);

SelectSort(a,n,0);

System.out.println("排序後：");

disp(a,n);

}

}

非遞歸：

public class kS {

public static void SelectSort(int a[],int n){

int tmp,k;

for(int i=0;i<n-1;i++){

k = i;

for(int j=i+1;j<n;j++){

if(a[j]<a[k]){

k=j;

}

}

if(k!=i){

tmp = a[i];

a[i] = a[k];

a[k] = tmp;

}

}

}

public static void disp(int a[],int n){

for(int i=0;i<n;i++){

System.out.printf("%2d",a[i]);

}

System.out.println();

}

public static void main(String[] args) {

int n = 10;

int []a = {2,4,6,3,5,9,1,7,8,0};

System.out.println("排序前：");

disp(a,n);

SelectSort(a,n);

System.out.println("排序後：");

disp(a,n);

}

}