Sortierung der Dateien und Databases

Die Algorithmen/quicksort.py

@@ -0,0 +1,26 @@
+import numpy as np
+arr = np.random.randint(0, 11, 1000)
+print(arr)
+def part(arr, low, high):
+    pivot = arr[high]
+    swap_number = low - 1
+
+    for counter in range(low, high):
+        if arr[counter] <= pivot:
+            swap_number += 1 
+            arr[swap_number],arr[counter] = arr[counter], arr[swap_number]
+
+    arr[swap_number + 1],arr[high] = arr[high], arr[swap_number + 1]
+    print(arr)
+    
+    return swap_number + 1
+
+def quicksort(arr, low, high):
+    if low < high:
+        recursion = part(arr, low, high)
+        quicksort(arr, low, recursion - 1)
+        quicksort(arr, recursion + 1, high)
+
+quicksort(arr, 0, len(arr) - 1)
+print(arr)
+