java递归实现选择排序_Java中的递归选择排序

我不确定我是否理解这个问题,但我创建了一个递归(和迭代)selectionsort和insertionsort只是为了好玩,希望它能帮助我。

public class Sorts {

public static void swap(Comparable[] a, int i, int j) {

Comparable temp = a[i];

a[i] = a[j];

a[j] = temp;

}

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

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

int f = i;

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

if (a[j].compareTo(a[f]) < 0)

f = j;

}

swap(a, i, f);

}

}

public static int select(Comparable[] a, int n, int j, int f) {

if (j >= n)

return f;

if (a[j].compareTo(a[f]) < 0)

f = j;

return select(a, n, j + 1, f);

}

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

if (i < n - 1) {

swap(a, i, select(a, n, i + 1, i));

selectionSort(a, n, i + 1);

}

}

public static void insertionSortItr(Comparable[] a) {

for (int i = 1; i < a.length; i++) {

int j;

Comparable cur = a[i];

for (j = i; j > 0 && cur.compareTo(a[j - 1]) < 0; j--) {

a[j] = a[j - 1];

}

a[j] = cur;

}

}

public static void insertionSortInner(Comparable[] a, Comparable cur, int j) {

if (j > 0 && cur.compareTo(a[j - 1]) < 0) {

a[j] = a[j - 1];

insertionSortInner(a, cur, j - 1);

} else {

a[j] = cur;

}

}

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

if (i < n) {

insertionSortInner(a, a[i], i);

insertionSort(a, i + 1, n);

}

}

public static void main(String[] args) {

Integer[] a = new Integer[10];

for (int i = 0; i < 10; i++)

a[i] = (int) (Math.random()*100);

selectionSort(a, 10, 0);

for (int i = 0; i < 10; i++)

System.out.println(a[i]);

}

}