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

bellcode / lesson13-4

  • 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
Switch branch/tag
  • lesson13-4
  • 11
Find file
BlameHistoryPermalink
  • BellCodeEditor's avatar
    save project · 61e847b9
    BellCodeEditor committed 2 years ago
    61e847b9
11 295 Bytes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
bingo_num=20
num_list =[1,3,5,8,11,15,17,18,20,21,]
low=0
high=len(num_list)-1
while  low<=high:
     mid=(low+)

















import random(1,101):
alist[]
for i range(1,101):
    alist.append(i)
num=random.choice(alist)
def binary_seaerch(A)