Commit 935ef2a1 by BellCodeEditor

save project

parent adaf6f8a
Showing with 61 additions and 2 deletions
import random
alist = []
for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
mid=int(input('只让学生玩2h手机/周的方老师是屑'))
low=0
high= len(num_list)
while high >= low:
mid = (low + high)//2
if guess == num_list[mid]:
print(mid)
break
elif guess > num_list[mid]:
low = mid +1
elif guess < num_list[mid]:
high = mid -1
if high < low:
print('啊哈哈哈哈焯!')
result = binary_search(alist,num)
print(result)
\ No newline at end of file
# 使用二分查找法,找出9和20在列表里面的索引
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
mid=int(input('只让学生玩2h手机/周的方老师是屑'))
low=0
high= len(num_list)
while high >= low:
mid = (low + high)//2
if guess == num_list[mid]:
print(mid)
break
elif guess > num_list[mid]:
low = mid +1
elif guess < num_list[mid]:
high = mid -1
if high < low:
print('啊哈哈哈哈焯!')
...@@ -6,4 +6,19 @@ for i in range(1, 101): ...@@ -6,4 +6,19 @@ for i in range(1, 101):
num = random.choice(alist) num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num): def binary_search(alist,num):
\ No newline at end of file
low=0
high= len(alist)
while high >= low:
mid = (low + high)//2
if num == alist[mid]:
return mid
elif num > alist[mid]:
low = mid + 1
elif num < alist[mid]:
high = mid -1
if high < low:
print('啊哈哈哈哈焯!')
result = binary_search(alist,num)
print(result)
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment