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 11b73c38 authored 2 years ago by BellCodeEditor's avatar BellCodeEditor
Browse files
Options
  • Browse Files
  • Download
  • Email Patches
  • Plain Diff

save project

parent 8cf9cd26
Show whitespace changes
Inline Side-by-side
Showing with 23 additions and 8 deletions
  • my_search.py
my_search.py
View file @ 11b73c38
import random from random import choice
alist = [] list = []
for i in range(1, 101): for i in range(101):
alist.append(i) list.append(i)
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file mb = choice(list)
def wow(alist,mb):
low = 0
high = len(alist)-1
while low<=high:
mid = (low+high)//2
gress = alist[mid]
if mb == gress:
return gress
break
elif gress<mb:
low = mid+1
else:
high = mid-1
return None
reuslt = wow(list,mb)
\ 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