save project

my_tree.py

-import turtle
-import random
+bingo_num = 20      # 要查找的数：20
+num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+low = 0
+high = len(num_list)-1
 
-pen = turtle.Turtle()
-pen.color('sienna')
-pen.speed(0)
-# 画布大小
-w = turtle.Screen()
-w.bgcolor('wheat')      # wheat小麦
-# # 移动到起点
-pen.left(90)
-pen.up()
-pen.backward(150)
-pen.down()
-
-# 树枝
-def tree(n):
-    if n >= 0:
-        if n <= 12:
-            color_list = ['snow', 'lightcoral']
-            color = random.choice(color_list)
-            pen.color(color)
-            pen.pensize(n / 3)
-        else:
-            pen.color('sienna')  # 赭(zhě)色
-            pen.pensize(n / 10)  
-        pen.forward(n)
-        angle = random.random()
-        pen.right(30*angle)
-        length = 1.5*random.random()
-        tree(n-10*length)
-        pen.left(60*angle)
-        tree(n-10*length)
-        pen.right(30*angle)
-        pen.up()
-        pen.backward(n)
-        pen.down()
-
-tree(60)
-turtle.done()
+# 当最低价格索引，小于等于最高价格时
+while low <= high:
+    mid = (low+high) // 2 #取中间价格的索引位置   //取整
+    guess_num = num_list[mid]   # 猜测的数值
+    if guess_num == bingo_num:
+        print("找到了，它在列表里的索引是：", mid)
+        break
+    elif guess_num < bingo_num:
+        low = mid+1
+    elif guess_num > bingo_num:
+        high = mid-1