Refactor the files and removed the duplicates

argonautica · Oct 10, 2019 · fa849ef · fa849ef
1 parent 1d8d6f8
commit fa849ef
Show file tree

Hide file tree

Showing 30 changed files with 203 additions and 144 deletions.
diff --git a/.idea/codeStyles/Project.xml b/.idea/codeStyles/Project.xml
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/InsertionSort-Java/InsertionSort-Java.iml → .idea/sorting-algorithms.iml b/InsertionSort-Java/InsertionSort-Java.iml → .idea/sorting-algorithms.iml
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
diff --git a/BubbleSort-C/BubbleSortC b/BubbleSort-C/BubbleSortC
diff --git a/BubbleSort-Java/BubbleSort.java b/BubbleSort-Java/BubbleSort.java
diff --git a/Bubble Sort - C++/BubbleSort.cpp → C++/BubbleSort.cpp b/Bubble Sort - C++/BubbleSort.cpp → C++/BubbleSort.cpp
diff --git a/HeapSort-C++/HeapSort.cpp → C++/HeapSort.cpp b/HeapSort-C++/HeapSort.cpp → C++/HeapSort.cpp
diff --git a/MergeSort-C++/Merge.cpp → C++/Merge.cpp b/MergeSort-C++/Merge.cpp → C++/Merge.cpp
diff --git a/QwickSort-C++/QuickSort.cpp → C++/QuickSort.cpp b/QwickSort-C++/QuickSort.cpp → C++/QuickSort.cpp
diff --git a/ShellSort-C++/ShellSort.cpp → C++/ShellSort.cpp b/ShellSort-C++/ShellSort.cpp → C++/ShellSort.cpp
diff --git a/BubbleSort-C/BubbleSortC.c → C/BubbleSort.c b/BubbleSort-C/BubbleSortC.c → C/BubbleSort.c
diff --git a/InsertionSort.c → C/InsertionSort.c b/InsertionSort.c → C/InsertionSort.c
@@ -1,23 +1,23 @@
-# include <stdio.h>
-int main(void)
-{
-    int ar[10], key, i, j;
-    printf ("Enter 10 numbers: \n");
-    for (i=0; i<10; i++)
-        scanf ("%d", &ar[i]);
-    for (i=1; i<10; i++)
-    {
-        key = ar[i];
-        j = i-1;
-        while (j>=0 && ar[j]>key)
-        {
-            ar[j+1] = ar[j];
-            j = j-1;
-        }
-        ar[j+1] = key;
-    }
-    printf ("The Sorted array:\n");
-    for (i=0; i<10; i++)
-        printf ("ar[%d] = %d\n", i, ar[i]);
-    return 0;
-}
+# include <stdio.h>
+int main(void)
+{
+    int ar[10], key, i, j;
+    printf ("Enter 10 numbers: \n");
+    for (i=0; i<10; i++)
+        scanf ("%d", &ar[i]);
+    for (i=1; i<10; i++)
+    {
+        key = ar[i];
+        j = i-1;
+        while (j>=0 && ar[j]>key)
+        {
+            ar[j+1] = ar[j];
+            j = j-1;
+        }
+        ar[j+1] = key;
+    }
+    printf ("The Sorted array:\n");
+    for (i=0; i<10; i++)
+        printf ("ar[%d] = %d\n", i, ar[i]);
+    return 0;
+}
diff --git a/QuickSort-C.c → C/QuickSort.c b/QuickSort-C.c → C/QuickSort.c
diff --git a/SelectionSort.c → C/SelectionSort.c b/SelectionSort.c → C/SelectionSort.c
@@ -1,30 +1,30 @@
-# include <stdio.h>
-#define MAX 1000
-int main(void)
-{
-    int i, j, N, pos, temp;
-    int ar[MAX];
-    printf ("Enter the number of integers to sort:");
-    scanf ("%d", &N); 
-    printf ("Enter the integers: \n");
-    for (i=0; i<N; i++)
-        scanf ("%d", &ar[i]);
-    for(i=0; i<N-1; i++)
-    {
-        pos = i;
-        for (j=i+1; j<N; j++)
-        {
-            if (ar[j]<ar[pos])
-            {
-                pos = j;
-            }
-        }
-        temp = ar[pos];
-        ar[pos]=ar[i];
-        ar[i]=temp;
-    }
-    printf ("The sorted array : \n");
-    for (i=0; i<N; i++)
-        printf ("ar[%d] = %d \n", i, ar[i]);
-    return 0;
-}
+# include <stdio.h>
+#define MAX 1000
+int main(void)
+{
+    int i, j, N, pos, temp;
+    int ar[MAX];
+    printf ("Enter the number of integers to sort:");
+    scanf ("%d", &N); 
+    printf ("Enter the integers: \n");
+    for (i=0; i<N; i++)
+        scanf ("%d", &ar[i]);
+    for(i=0; i<N-1; i++)
+    {
+        pos = i;
+        for (j=i+1; j<N; j++)
+        {
+            if (ar[j]<ar[pos])
+            {
+                pos = j;
+            }
+        }
+        temp = ar[pos];
+        ar[pos]=ar[i];
+        ar[i]=temp;
+    }
+    printf ("The sorted array : \n");
+    for (i=0; i<N; i++)
+        printf ("ar[%d] = %d \n", i, ar[i]);
+    return 0;
+}
diff --git a/radixsort-go/radix.go → Go/RadixSort.go b/radixsort-go/radix.go → Go/RadixSort.go
diff --git a/BogoSort-Java/BogoSort.java → Java/BogoSort.java b/BogoSort-Java/BogoSort.java → Java/BogoSort.java
diff --git a/...edBubbleSort-Java/ImprovedBubbleSort.java → Java/BubbleSort.java b/...edBubbleSort-Java/ImprovedBubbleSort.java → Java/BubbleSort.java
@@ -1,5 +1,5 @@
 
-public class ImprovedBubbleSort {
+public class BubbleSort {
     //verifies if the arry is already sorted
     //Thus, the best time complexity is improved from O(n^2) to O(n)
     static void improvedBubbleSort(int[] arr) {

diff --git a/InsertionSort-Java/src/InsertionSort.java → Java/InsertionSort.java b/InsertionSort-Java/src/InsertionSort.java → Java/InsertionSort.java
diff --git a/MergeSort-java/src/MergeSort.java → Java/MergeSort.java b/MergeSort-java/src/MergeSort.java → Java/MergeSort.java
diff --git a/QuickSort in Java/quicksort.java → Java/QuickSort.java b/QuickSort in Java/quicksort.java → Java/QuickSort.java
diff --git a/SelectionSort-Java/SelectionSort.java → Java/SelectionSort.java b/SelectionSort-Java/SelectionSort.java → Java/SelectionSort.java
diff --git a/bogosort-python/bogosort.py → Python/BogoSort.py b/bogosort-python/bogosort.py → Python/BogoSort.py
diff --git a/BucketSort- Python → Python/BucketSort.py b/BucketSort- Python → Python/BucketSort.py
diff --git a/GnomeSort-Python/GnomeSort.py → Python/GnomeSort.py b/GnomeSort-Python/GnomeSort.py → Python/GnomeSort.py
diff --git a/QuickSort-Python/quick_sort.py → Python/QuickSort.py b/QuickSort-Python/quick_sort.py → Python/QuickSort.py
diff --git a/GnomeSort-Python/RadixSort.py → Python/RadixSort.py b/GnomeSort-Python/RadixSort.py → Python/RadixSort.py
diff --git a/SelectionSort-Python/SelectionSort.py → Python/SelectionSort.py b/SelectionSort-Python/SelectionSort.py → Python/SelectionSort.py
@@ -1,18 +1,18 @@
-def selectionSort(l):
-    for start in range(len(l)):
-
-        #assign start value as minimum value
-        minpos=start
-
-        for i in range(start,len(l)):
-            if(l[i]<l[minpos]):
-                minpos=i
-
-        (l[start],l[minpos]) = (l[minpos],l[start])
-
-
-if __name__ == "__main__":
-    print('Enter sequence(separated by spaces): ')
-    arr=[int(x) for x in input().split()]
-    selectionSort(arr)
-    print(arr)
+def selectionSort(l):
+    for start in range(len(l)):
+
+        #assign start value as minimum value
+        minpos=start
+
+        for i in range(start,len(l)):
+            if(l[i]<l[minpos]):
+                minpos=i
+
+        (l[start],l[minpos]) = (l[minpos],l[start])
+
+
+if __name__ == "__main__":
+    print('Enter sequence(separated by spaces): ')
+    arr=[int(x) for x in input().split()]
+    selectionSort(arr)
+    print(arr)
diff --git a/SelectionSort-Java/SelectionSort.class b/SelectionSort-Java/SelectionSort.class
diff --git a/quicksorting.java b/quicksorting.java