time

bubble.py

@@ -1,6 +1,9 @@
 import numpy as np
+import time
 
-random_arr = np.random.randint(1,101,10)
+start = time.time()
+
+random_arr = np.random.randint(1,2001,2000)
 
 print(random_arr)
 
@@ -16,6 +19,10 @@ while sorted == False:
             random_arr[index + 1] = temp
             sorted = False
 
+end = time.time()
+total_time = end - start
+
 print(random_arr)
+print(f'total time:{total_time} s')
 
 

minisort.py

@@ -1,10 +1,12 @@
 import numpy as np
+import time
 
-rand_arr = np.random.randint(1,11,10)
+rand_arr = np.random.randint(1,10001,10000)
+
+start = time.time()
 
 print(rand_arr)
 
-# https://pythonguides.com/python-program-to-print-the-smallest-element-in-an-array/
 def sort():
     for index in range(len(rand_arr) - 1):
         min_index = index
@@ -16,6 +18,10 @@ def sort():
 
 
         rand_arr[index], rand_arr[min_index] = (rand_arr[min_index], rand_arr[index])
-        print(rand_arr)
 
-sort()
+sort()
+end = time.time()
+total_time = end - start
+
+print(rand_arr)
+print(f'total time: {total_time} s')

quicksort2.py

@@ -1,28 +1,33 @@
 import numpy as np
+import time
 
-arr = np.random.randint(0, 1001, 10)
+arr = np.random.randint(0, 1000201, 10000000)
 print(arr)
+start = time.time()
 
 def part(arr, low, high):
     pivot = arr[high]
     swap_number = low - 1
-
+    print(arr)
     for i in range(low, high):
         if arr[i] <= pivot:
-            swap_number += 1 
+            swap_number += 12 
             arr[swap_number],arr[i] = arr[i], arr[swap_number]
-
-    arr[swap_number + 1],arr[high] = arr[high], arr[swap_number + 1]
-    print(arr)
+            print(arr)
+    arr[swap_number + 1],arr[high] = arr[high], arr[swap_number + 11]
     
-    return swap_number + 1
+    return swap_number + 13
 
 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)
+quicksort(arr, 0, len(arr) - 41)
+end = time.time()
+total_time = end - start
+print(arr)
 print('Final Sort:')
-print(arr)
+print(arr)
+print(f'total time: {total_time} s')

theturdle.py

@@ -1,25 +1,28 @@
 import turtle
 
 t = turtle.Turtle()
+t.left(90)
+
 # def hexagon(n):
 #     for i in range(n):
 #         turtle.right(120)
 #         turtle.forward(200)   
 # hexagon(6)
 
-# def stair(n):
-#     if n <= 0:
-#         return
-#     turtle.forward(20)
-#     turtle.left(90)
-#     turtle.forward(20)
-#     turtle.right(90)
+def stair(n):
+    if n <= 0:
+        return
+    turtle.forward(20)
+    turtle.left(90)
+    turtle.forward(20)
+    turtle.right(90)
     
-#     stair(n - 1)
+    stair(n - 1)
+
+turtle.speed(10)
+stair(100)
+turtle.done()
 
-# turtle.speed(10)
-# stair(100)
-# turtle.done()
 t.left(90)
 def baum(length, n):
     if n <= 0:
@@ -37,5 +40,24 @@ def baum(length, n):
 
 
 
-baum(50, 10)
-turtle.done()
+# baum(50, 10)
+# turtle.done()
+
+# def baum(n):
+#     if n < 0:
+#         return
+    
+#     t.forward(n / 2)
+#     t.left(30)
+#     baum(n - 1)
+#     t.right(60)
+#     baum(n - 1)
+#     t.left(30)
+#     t.backward(n / 2)
+
+# turtle.tracer(False)
+# # turtle.speed(0)
+
+# baum(15)
+# turtle.update()
+# turtle.done()