Initial commit

Author: KyattPL

LSDradixSort.py

@@ -0,0 +1,36 @@
+from random import randint
+
+def counting_sort(arr, exp):
+    n = len(arr)
+    newArr = [0] * n
+    count = [0] * 10
+    for i in range(n):
+        index = arr[i]/exp
+        count[index % 10] += 1
+    for i in range(1,10):
+        count[i] += count[i-1]
+    i = n - 1
+    while i >= 0:
+        index = arr[i]/exp
+        newArr[count[index % 10] - 1] = arr[i]
+        count[index % 10] -= 1
+        i -= 1
+    for i in range(len(arr)):
+        arr[i] = newArr[i]
+    return arr
+
+
+def lsd_radix_sort(arr):
+    maximum = max(arr)
+    exp = 1
+    while maximum/exp > 0:
+        counting_sort(arr, exp)
+        exp *= 10
+    return arr
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(randint(0,10))
+    print(lsd_radix_sort(array))

bogoSort.py

@@ -0,0 +1,32 @@
+# As a joke
+from random import randint, random
+
+def bogo_sort(arr):
+    while not is_sorted(arr):
+        arr = permutation(arr)
+    return arr
+
+
+def is_sorted(arr):
+    for i in range(len(arr) - 1):
+        if arr[i] > arr[i+1]:
+            return False
+    return True
+
+
+def permutation(arr):
+    indexes = []
+    for i in range(len(arr)):
+        indexes.append(i)
+    newArr = []
+    for i in range(len(arr)):
+        index = randint(0, len(indexes)-1)
+        newArr.append(arr[indexes.pop(index)])
+    return newArr
+
+if __name__ == "__main__":
+    array = []
+    for i in range(10):
+        array.append(random())
+    bogo_sort(array)
+    print("Sorted!")

bubbleSort.py

@@ -0,0 +1,19 @@
+from random import random
+
+def bubble_sort(arr):
+    for i in range(len(arr)):
+        swapped = False
+        for j in range(len(arr) - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j + 1], arr[j] = arr[j], arr[j + 1]
+                swapped = True
+        if not swapped:
+            break
+    return arr
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(random())
+    bubble_sort(array)
+    print(bubble_sort(array))

bucketSort.py

@@ -0,0 +1,26 @@
+from random import randint
+from insertionSort import insertion_sort
+
+def bucket_sort(arr, k=5):
+    buckets = []
+    for i in range(k):
+        buckets.append([])
+    newTab = []
+    maximum = max(arr)
+    for i in range(len(arr)):
+        index = int(k * arr[i] / maximum)
+        if index == k:
+            index -= 1
+        buckets[index].append(arr[i])
+    for i in range(k):
+        buckets[i] = insertion_sort(buckets[i])
+        for j in range(len(buckets[i])):
+            newTab.append(buckets[i][j])
+    return newTab
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(randint(0, 9))
+    print(bucket_sort(array))

combSort.py

@@ -0,0 +1,24 @@
+from random import random
+
+def comb_sort(arr):
+    factor = 1.3
+    gap = len(arr)
+    isSorted = False
+    while not isSorted:
+        gap = int(gap / factor)
+        if gap <= 1:
+            isSorted = True
+            factor = 1
+        for i in range(len(arr) - gap):
+            offsetIndex = gap + i
+            if arr[i] > arr[offsetIndex]:
+                arr[i], arr[offsetIndex] = arr[offsetIndex], arr[i]
+                isSorted = False
+    return arr
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(random())
+    print(comb_sort(array))

countingSort.py

@@ -0,0 +1,21 @@
+from random import randint
+
+def counting_sort(arr):
+    spread = max(arr) - min(arr) + 1
+    countArr = [0] * spread
+    newArr = [0] * len(arr)
+    for i in range(len(arr)):
+        countArr[arr[i]] += 1
+    for i in range(1, spread):
+        countArr[i] += countArr[i-1]
+    for i in range(len(arr)-1, -1, -1):
+        countArr[arr[i]] -= 1
+        newArr[countArr[arr[i]]] = arr[i]
+    return newArr
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(randint(0,10))
+    print(counting_sort(array))

insertionSort.py

@@ -0,0 +1,18 @@
+from random import random
+
+def insertion_sort(arr):
+    for i in range(1, len(arr)):
+        chosenElem = arr[i]
+        j = i - 1
+        while j >= 0 and arr[j] > chosenElem:
+            arr[j+1] = arr[j]
+            j -= 1
+        arr[j+1] = chosenElem
+    return arr
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(random())
+    print(insertion_sort(array))

insertionSort.pyc

@@ -0,0 +1,39 @@
+from random import random
+
+def merge_sort(arr): 
+    if len(arr) >1: 
+        mid = len(arr)//2
+        L = arr[:mid]
+        R = arr[mid:]
+  
+        merge_sort(L)
+        merge_sort(R)
+  
+        i = j = k = 0
+          
+        while i < len(L) and j < len(R): 
+            if L[i] < R[j]: 
+                arr[k] = L[i] 
+                i+= 1
+            else: 
+                arr[k] = R[j] 
+                j+= 1
+            k+= 1
+
+        while i < len(L): 
+            arr[k] = L[i] 
+            i+= 1
+            k+= 1
+          
+        while j < len(R): 
+            arr[k] = R[j] 
+            j+= 1
+            k+= 1
+
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(random())
+    merge_sort(array)
+    print(array)

mergeSort.py

@@ -0,0 +1,21 @@
+from random import randint
+
+def pigeonhole_sort(arr):
+    minimum = min(arr)
+    size = max(arr) - minimum + 1
+    holes = [0] * size
+    for x in arr:
+        holes[x - minimum] += 1
+    i = 0
+    for count in range(size):
+        while holes[count] > 0:
+            holes[count] -= 1
+            arr[i] = count + minimum
+            i += 1
+    return arr
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(randint(0, 10))
+    print(pigeonhole_sort(array))

pigeonholeSort.py

@@ -0,0 +1,17 @@
+from random import random
+
+def selection_sort(arr):
+    for i in range(len(arr)):
+        minimum = i
+        for j in range(i+1, len(arr)):
+            if arr[j] < arr[minimum]:
+                minimum = j
+        if minimum != i:
+            arr[i], arr[minimum] = arr[minimum], arr[i]
+    return arr
+
+if __name__ == "__main__":
+    array = []
+    for i in range(20):
+        array.append(random())
+    print(selection_sort(array))