### Question:
LearnSort { public static int[] selectionSort(int[] array) { int len = array.length; for (int i = 0; i < len; i++) { int position = i; int temp = array[i]; for (int j = i + 1; j < len; j++) { if (temp > array[j]) { temp = array[j]; position = j; } } if (position > i) { array[position] = array[i]; array[i] = temp; } } return array; }  static int[] insertSort(int[] array); static int[] shellSort(int[] array); static int[] selectionSort(int[] array); static int[] heapSort(int[] array); static int[] bubbleSort(@NotNull int[] array); static int[] quickSort(@NotNull int[] array); static int[] mergingSort(int[] array); static int[] radixSort(@NotNull int[] arr); final static int[] originalArray; }### Answer:
@Test public void testSelectionSort() throws Exception { Assert.assertThat(resultArray, Matchers.equalTo(LearnSort.selectionSort(originalArray))); }