Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
Administrator
/
level3-lesson16-diy2
This project
Loading...
Sign in
Toggle navigation
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
8ccf99aa
authored
Apr 05, 2025
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
auto save
parent
a82149d9
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
35 additions
and
0 deletions
qwertyuiop.py
qwertyuiop.py
0 → 100644
View file @
8ccf99aa
import
random
alist
=
[]
for
i
in
range
(
1
,
101
):
alist
.
append
(
i
)
num
=
random
.
choice
(
alist
)
def
binary_search
(
alist
,
num
):
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
return
None
result
=
binary_search
(
alist
,
nom
)
print
(
"老师给的数是:"
,
num
)
print
(
"它在列表里的索引是:"
,
result
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment