fix: removed warning for Sorts 'C-style array declaration of parameter 'array''

Sorts/BogoSort.java

@@ -12,15 +12,15 @@ public class BogoSort implements SortAlgorithm {
     private static final Random random = new Random();
 
 
-    private static <T extends Comparable<T>> boolean isSorted(T array[]) {
+    private static <T extends Comparable<T>> boolean isSorted(T[] array) {
         for (int i = 0; i < array.length - 1; i++) {
             if (SortUtils.less(array[i + 1], array[i])) return false;
         }
         return true;
     }
 
     // Randomly shuffles the array
-    private static <T> void nextPermutation(T array[]) {
+    private static <T> void nextPermutation(T[] array) {
         int length = array.length;
 
         for (int i = 0; i < array.length; i++) {
@@ -29,7 +29,7 @@ private static <T> void nextPermutation(T array[]) {
         }
     }
 
-    public <T extends Comparable<T>> T[] sort(T array[]) {
+    public <T extends Comparable<T>> T[] sort(T[] array) {
         while (!isSorted(array)) {
             nextPermutation(array);
         }

Sorts/BubbleSort.java

@@ -17,7 +17,7 @@ class BubbleSort implements SortAlgorithm {
      **/
 
     @Override
-    public <T extends Comparable<T>> T[] sort(T array[]) {
+    public <T extends Comparable<T>> T[] sort(T[] array) {
         for (int i = 0, size = array.length; i < size - 1; ++i) {
             boolean swapped = false;
             for (int j = 0; j < size - 1 - i; ++j) {

Sorts/CombSort.java

@@ -33,7 +33,7 @@ private int nextGap(int gap) {
      * @return sorted array
      */
     @Override
-    public <T extends Comparable<T>> T[] sort(T arr[]) {
+    public <T extends Comparable<T>> T[] sort(T[] arr) {
         int size = arr.length;
 
         // initialize gap
@@ -62,9 +62,9 @@ public <T extends Comparable<T>> T[] sort(T arr[]) {
     }
 
     // Driver method
-    public static void main(String args[]) {
+    public static void main(String[] args) {
         CombSort ob = new CombSort();
-        Integer arr[] = {8, 4, 1, 56, 3, -44, -1, 0, 36, 34, 8, 12, -66, -78, 23, -6, 28, 0};
+        Integer[] arr = {8, 4, 1, 56, 3, -44, -1, 0, 36, 34, 8, 12, -66, -78, 23, -6, 28, 0};
         ob.sort(arr);
 
         System.out.println("sorted array");

Sorts/RadixSort.java

@@ -4,18 +4,18 @@
 
 class RadixSort {
 
-    private static int getMax(int arr[], int n) {
+    private static int getMax(int[] arr, int n) {
         int mx = arr[0];
         for (int i = 1; i < n; i++)
             if (arr[i] > mx)
                 mx = arr[i];
         return mx;
     }
 
-    private static void countSort(int arr[], int n, int exp) {
-        int output[] = new int[n];
+    private static void countSort(int[] arr, int n, int exp) {
+        int[] output = new int[n];
         int i;
-        int count[] = new int[10];
+        int[] count = new int[10];
         Arrays.fill(count, 0);
 
         for (i = 0; i < n; i++)
@@ -33,7 +33,7 @@ private static void countSort(int arr[], int n, int exp) {
             arr[i] = output[i];
     }
 
-    private static void radixsort(int arr[], int n) {
+    private static void radixsort(int[] arr, int n) {
 
         int m = getMax(arr, n);
 
@@ -43,14 +43,14 @@ private static void radixsort(int arr[], int n) {
     }
 
 
-    static void print(int arr[], int n) {
+    static void print(int[] arr, int n) {
         for (int i = 0; i < n; i++)
             System.out.print(arr[i] + " ");
     }
 
 
     public static void main(String[] args) {
-        int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
+        int[] arr = {170, 45, 75, 90, 802, 24, 2, 66};
         int n = arr.length;
         radixsort(arr, n);
         print(arr, n);