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 ac51b0c4 authored a year ago by BellCodeEditor's avatar BellCodeEditor
Browse files
Options
  • Browse Files
  • Download
  • Email Patches
  • Plain Diff

auto save

parent adaf6f8a
Hide whitespace changes
Inline Side-by-side
Showing with 16 additions and 2 deletions
  • my_search.py
my_search.py
View file @ ac51b0c4
...@@ -3,7 +3,21 @@ import random ...@@ -3,7 +3,21 @@ import random
alist = [] alist = []
for i in range(1, 101): for i in range(1, 101):
alist.append(i) alist.append(i)
#alist=[x for x in range(1,101)]
num = random.choice(alist) num = random.choice(alist)
print(num)
# 请完善二分查找函数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)-1
while low<=high:
mid=(low+high)//2
guess=alist[mid]
if guess==num:
return mid
elif guess<num:
low=mid+1
else:
high=mid-1
print(binary_search(alist,num))
\ 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