In Java, implement Recursive Selection Sort. Compare results of iterative vs recursive Binary search.

Iterative code:

public class SelectionSort {

/** The method for sorting the numbers */

public static void selectionSort(double[] list) {

for (int i = 0; i < list.length - 1; i++) {

// Find the minimum in the list[i..list.length-1]

double currentMin = list[i];

int currentMinIndex = i;

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

if (currentMin > list[j]) {

currentMin = list[j];

currentMinIndex = j;

}

}

// Swap list[i] with list[currentMinIndex] if necessary;

if (currentMinIndex != i) {

list[currentMinIndex] = list[i];

list[i] = currentMin;

}

}

}

public static void main(String[] args) {

long begin = System.nanoTime();

double[] list = {-2, 4.5, 5, 1, 2, -3.3};

selectionSort(list);

for (int i = 0; i < list.length; i++)

System.out.print(list[i] + " ");

long end = System.nanoTime();

long time = end - begin;

System.out.println(" ");

System.out.println("It took " + time + " nanoseconds to run.");

}

}