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
bfff6ac9
authored
Jul 29, 2023
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
save project
parent
a37839bc
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
24 additions
and
16 deletions
binary_search.py
binary_search.py
View file @
bfff6ac9
# 什么都没有输出,说明不在列表里
bingo_num
=
20
# 要查找的数:20
num_list
=
[
1
,
3
,
5
,
8
,
11
,
15
,
17
,
18
,
20
,
21
]
low
=
0
high
=
len
(
num_list
)
-
1
import
random
# 当最低价格索引,小于等于最高价格时
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
:
high
=
mid
-
1
alist
=
[]
for
i
in
range
(
1
,
101
):
alist
.
append
(
i
)
num
=
random
.
choice
(
alist
)
# 请完善二分查找函数binary_search(),查找出num在列表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
,
num
)
print
(
"老师给的数是:"
,
num
)
print
(
"它在列表里的索引是:"
,
result
)
# 列表从1开始,索引从0开始,所以少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