|
| 1 | +package Sorts; |
| 2 | + |
| 3 | +import static Sorts.SortUtils.*; |
| 4 | + |
1 | 5 | /** |
2 | 6 | * |
3 | 7 | * @author Varun Upadhyay (https://github.com/varunu28) |
4 | 8 | * |
5 | 9 | */ |
6 | 10 |
|
7 | | -public class SelectionSort { |
| 11 | +public class SelectionSort implements SortAlgorithm { |
8 | 12 |
|
9 | 13 | /** |
10 | 14 | * This method implements the Generic Selection Sort |
11 | 15 | * |
12 | 16 | * @param arr The array to be sorted |
13 | | - * @param n The count of total number of elements in array |
14 | 17 | * Sorts the array in increasing order |
15 | 18 | **/ |
16 | | - |
17 | | - public static <T extends Comparable<T>> void SS(T[] arr, int n) { |
18 | | - |
19 | | - for (int i=0;i<n-1;i++) { |
20 | | - |
| 19 | + @Override |
| 20 | + public <T extends Comparable<T>> T[] sort(T[] arr) { |
| 21 | + int n = arr.length; |
| 22 | + for (int i = 0; i < n - 1; i++) { |
21 | 23 | // Initial index of min |
22 | 24 | int min = i; |
23 | 25 |
|
24 | | - for (int j=i+1;j<n;j++) { |
25 | | - if (arr[j].compareTo(arr[min]) < 0) { |
| 26 | + for (int j = i +1 ; j < n; j++) { |
| 27 | + if (less(arr[j], arr[min])) { |
26 | 28 | min = j; |
27 | 29 | } |
28 | 30 | } |
29 | 31 |
|
30 | 32 | // Swapping if index of min is changed |
31 | 33 | if (min != i) { |
32 | | - T temp = arr[i]; |
33 | | - arr[i] = arr[min]; |
34 | | - arr[min] = temp; |
| 34 | + swap(arr, i , min); |
35 | 35 | } |
36 | 36 | } |
| 37 | + |
| 38 | + return arr; |
37 | 39 | } |
38 | 40 |
|
39 | 41 | // Driver Program |
40 | 42 | public static void main(String[] args) { |
41 | 43 |
|
42 | | - // Integer Input |
43 | | - int[] arr1 = {4,23,6,78,1,54,231,9,12}; |
44 | | - int n = arr1.length; |
| 44 | + Integer[] arr = {4, 23, 6, 78, 1, 54, 231, 9, 12}; |
45 | 45 |
|
46 | | - Integer[] array = new Integer[n]; |
47 | | - for (int i=0;i<n;i++) { |
48 | | - array[i] = arr1[i]; |
49 | | - } |
| 46 | + SelectionSort selectionSort = new SelectionSort(); |
50 | 47 |
|
51 | | - SS(array, n); |
| 48 | + Integer[] sorted = selectionSort.sort(arr); |
52 | 49 |
|
53 | 50 | // Output => 1 4 6 9 12 23 54 78 231 |
54 | | - for(int i=0; i<n; i++) |
55 | | - { |
56 | | - System.out.print(array[i]+"\t"); |
57 | | - } |
58 | | - |
59 | | - System.out.println(); |
| 51 | + print(sorted); |
60 | 52 |
|
61 | 53 | // String Input |
62 | | - String[] array1 = {"c", "a", "e", "b","d"}; |
63 | | - n = array1.length; |
64 | | - |
65 | | - SS(array1, n); |
| 54 | + String[] strings = {"c", "a", "e", "b","d"}; |
| 55 | + String[] sortedStrings = selectionSort.sort(strings); |
66 | 56 |
|
67 | 57 | //Output => a b c d e |
68 | | - for(int i=0; i<n; i++) |
69 | | - { |
70 | | - System.out.print(array1[i]+"\t"); |
71 | | - } |
| 58 | + print(sortedStrings); |
72 | 59 | } |
73 | 60 | } |
0 commit comments