save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-
-def binary_search(alist,num):
-    low = 0
-    high = len(alist)-1
-    while low <= high:
-        mid = (low + high) // 2
-        guess = alist[mid]
-        if guess == num:
-            return mid
-        elif guess < num:
+import turtle
+a = turtle.Pen()
+a.pencolor("red")
+a.pensize(5)
+a.left(45)
+a.forward(100)
+a.circle(50,180)
+a.right(90)
+a.circle(50,180)
+a.forward(100)
+turtle.done()
\ No newline at end of file
-            low = mid + 1
-        else:
-            high = mid - 1
\ No newline at end of file