Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
Administrator
/
level3-lesson16-diy1
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
80993cab
authored
Mar 19, 2023
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
auto save
parent
b250abfe
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
35 additions
and
3 deletions
DIY2.PY
binary_search.py
DIY2.PY
0 → 100644
View file @
80993cab
import
random
alist
=
[]
for
i
in
range
(
1
,
100
)
alist
.
append
(
i
)
num
=
random
.
choice
(
alist
)
def
binary_sectch
(
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_sectch
(
alist
,
num
)
print
(
"老师给的数量:"
,
num
)
print
(
"它在列表里的索引是:"
,
result
)
binary_search.py
View file @
80993cab
# 使用二分查找法,找出9和20在列表里面的索引
num_list
=
[
1
,
3
,
5
,
8
,
11
,
15
,
17
,
18
,
20
,
21
]
\ No newline at end of file
bingo_num
=
20
# 使用二分查找法,找出9和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
+
high
)
//
2
guess_num
=
num_list
[
mid
]
if
guess_num
==
bingo_num
:
print
(
'找到了,它在列表中的索引是:'
,
mid
)
break
elif
guess_num
<
bingo_num
:
low
=
mid
+
1
elif
guess_num
>
bingo_num
:
low
=
mid
-
1
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