Skip to content
  • P
    Projects
  • G
    Groups
  • S
    Snippets
  • Help

Administrator / level3-lesson16-diy2

  • This project
    • Loading...
  • Sign in
Go to a project
  • Project
  • Repository
  • Issues 0
  • Merge Requests 0
  • Pipelines
  • Wiki
  • Snippets
  • Members
  • Activity
  • Graph
  • Charts
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
  • Files
  • Commits
  • Branches
  • Tags
  • Contributors
  • Graph
  • Compare
  • Charts
Commit 852bf448 authored 2 years ago by BellCodeEditor's avatar BellCodeEditor
Browse files
Options
  • Browse Files
  • Download
  • Email Patches
  • Plain Diff

save project

parent adaf6f8a
Hide whitespace changes
Inline Side-by-side
Showing with 33 additions and 2 deletions
  • a.py
  • my_search.py
a.py 0 → 100644
View file @ 852bf448
a = 20
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
l = 0
while l <= h:
mid = (h + l) // 2
gue = num_list[mid]
if gue == a:
print("找到了,他的索引是", mid)
break
elif gue < a:
l = mid + 1
elif gue > a:
h = mid - 1
\ No newline at end of file
This diff is collapsed. Click to expand it.
my_search.py
View file @ 852bf448
...@@ -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 l = 0
h = len(alist) - 1
while l <= h:
mid = (h + l) // 2
gue = alist[mid]
if gue == num:
return mid
elif gue < num:
l = mid + 1
elif gue > num:
h = mid - 1
return None
result = binary_search(alist,num)
print('老师给的数是',num)
print('他的索引是',result)
\ No newline at end of file
This diff is collapsed. Click to expand it.
  • Write
  • Preview
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