devil00
diff --git a/‎Sorts/cyclesort.java‎
Lines changed: 0 additions & 78 deletions b/‎Sorts/cyclesort.java‎
Lines changed: 0 additions & 78 deletions
diff --git a/‎Sorts/HeapSort.java‎ ‎Sorts/src/sort/HeapSort.java‎Sorts/HeapSort.java renamed to Sorts/src/sort/HeapSort.java b/‎Sorts/HeapSort.java‎ ‎Sorts/src/sort/HeapSort.java‎Sorts/HeapSort.java renamed to Sorts/src/sort/HeapSort.java
diff --git a/‎Sorts/radixSort.java‎ ‎Sorts/src/sort/RadixSort.java‎Sorts/radixSort.java renamed to Sorts/src/sort/RadixSort.java
Lines changed: 8 additions & 8 deletions b/‎Sorts/radixSort.java‎ ‎Sorts/src/sort/RadixSort.java‎Sorts/radixSort.java renamed to Sorts/src/sort/RadixSort.java
Lines changed: 8 additions & 8 deletions
@@ -1,18 +1,19 @@
-import java.util.*;
+package sort;
+
+import java.util.Arrays;
 
-class Radix {
+class RadixSort {
 
 
-    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;
     }
- 
-    static void countSort(int arr[], int n, int exp)
+
+    private static void countSort(int arr[], int n, int exp)
     {
         int output[] = new int[n];
         int i;
@@ -35,8 +36,7 @@ static void countSort(int arr[], int n, int exp)
             arr[i] = output[i];
     }
 
-    static void radixsort(int arr[], int n)
-    {
+    private static void radixsort(int arr[], int n) {
 
         int m = getMax(arr, n);