/** Selection Sort in Java: a. int: min -> max b. int: max -> min c. double: min -> max d. double: max -> min Method overloading is used. For each. */ public class mainClass { public static void main(String[] args) { int[] arrayInt = {6,4,1,8,3,4,1,7,0}; double[] arrayDouble = {6.3,4.6,1.2,8.4,3.3,4.5,1.6,7.9,0.2}; // int: min -> max System.out.println("int: min -> max"); arrayInt = sort_array_class.sort_array(arrayInt); for (int i: arrayInt) { System.out.print(i+" "); } System.out.print("\n\n"); System.out.println("int: max -> min"); // int: max -> min arrayInt = sort_array_class.sort_array_max(arrayInt); for (int i: arrayInt) { System.out.print(i+" "); } System.out.print("\n\n"); System.out.println("double: min -> max"); // double: min -> max arrayDouble = sort_array_class.sort_array(arrayDouble); for (double i: arrayDouble) { System.out.print(i+" "); } System.out.print("\n\n"); System.out.println("double: max -> min"); //double: max -> min arrayDouble = sort_array_class.sort_array_max(arrayDouble); for (double i: arrayDouble) { System.out.print(i+" "); } } } public class sort_array_class { public static int[] sort_array (int[] array) { for (int i = 0; i < array.length - 1; i++) { int min = i; for (int j = i + 1; j < array.length; j++) { if (array[min] > array[j]) { min = j; } } if (i != min) { int x = array[i]; array[i] = array[min]; array[min] = x; } } return array; } public static int[] sort_array_max (int[] array) { for (int i = 0; i < array.length - 1; i++) { int max = i; for (int j = i + 1; j < array.length; j++) { if (array[max] < array[j]) { max = j; } } if (i != max) { int x = array[i]; array[i] = array[max]; array[max] = x; } } return array; } public static double[] sort_array (double[] array) { for (int i = 0; i < array.length - 1; i++) { int min = i; for (int j = i + 1; j < array.length; j++) { if (array[min] > array[j]) { min = j; } } if (i != min) { double x = array[i]; array[i] = array[min]; array[min] = x; } } return array; } public static double[] sort_array_max (double[] array) { for (int i = 0; i < array.length - 1; i++) { int max = i; for (int j = i + 1; j < array.length; j++) { if (array[max] < array[j]) { max = j; } } if (i != max) { double x = array[i]; array[i] = array[max]; array[max] = x; } } return array; } }