lecture

SoSe24/lec03_sort_alg/quick_plot.py

 import matplotlib.pyplot as plt
 import quick_sort as qs
 
-
-
-
 if __name__ == "__main__":
-    filename = "../../seq3_sorted.txt"
+    filename = "../../seq3.txt"
+    #filename = "../../seq3_sorted.txt"
     dummy = read_int_sequence(filename)
     n = len(dummy)
     step = n // 100

SoSe24/lec03_sort_alg/quick_sort.py

 from SoSe24.algodat.foundation import AlgoDatArray, AlgoDatValue, read_int_sequence
 from time import perf_counter as pfc
 
+
 def partition(z: AlgoDatArray, left: int, right: int) -> int:
     global pivot
-    pivot.value  = z[right]
+    pivot.value = z[right]
     i = left
     j = right - 1
     while i < j:
         z[i], z[right] = z[right], z[i]
     return i
 
+
 def median_pivot(z: AlgoDatArray, left: int, right: int) -> int:
     mid = left + (right - left) // 2
     if z[left] < z[right]:
                 z[left], z[right] = z[right], z[left]
     return partition(z, left, right)
 
+
 def quick_sort(z: AlgoDatArray, left: int, right: int):
     if left < right:
         q = partition(z, left, right)
         quick_sort(z, left, q-1)
         quick_sort(z, q+1, right)
 
+
 pivot = AlgoDatValue(0)
 
 if __name__ == "__main__":