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
95da13a8
authored
May 21, 2023
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
save project
parent
5e834234
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
32 additions
and
21 deletions
my_search.py
my_search.py
View file @
95da13a8
import
random
import
random
alist
=
[]
for
i
in
range
(
1
,
101
):
for
i
in
range
(
1
,
101
):
alist
=
[
i
]
alist
.
append
(
i
)
alist
.
append
(
i
)
num
=
random
.
choice
(
alist
)
num
=
random
.
choice
(
alist
)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def
binary_search
(
alist
,
num
):
def
binary_search
(
alist
,
num
):
low
=
0
low
=
0
high
=
len
(
alist
)
-
1
high
=
len
(
alist
)
-
1
a
=
input
(
int
(
'0,100的数'
))
while
low
<=
high
:
while
i
==
a
:
mid
=
(
low
+
high
)
//
2
if
i
==
a
:
guess
=
alist
[
mid
]
print
(
"找到了"
)
if
guess
==
num
:
break
return
mid
elif
i
>
a
:
elif
guess
<
num
:
print
(
"100"
,
a
)
low
=
mid
+
1
b
=
input
(
int
())
else
:
if
i
==
b
:
high
=
mid
-
1
print
(
"找到了"
)
return
None
break
result
=
binary_search
(
alist
,
num
)
elif
i
<
a
:
print
(
num
)
print
(
a
,
"100"
)
print
(
result
)
b
=
input
(
int
())
# a=input(int('0,100的数'))
if
i
==
b
:
# while i==a:
print
(
"找到了"
)
# if i==a:
break
# print("找到了")
\ No newline at end of file
# break
# elif i>a:
# print("100",a)
# b=input(int())
# if i==b:
# print("找到了")
# break
# elif i<a:
# print(a,"100")
# b=input(int())
# if i==b:
# print("找到了")
# break
\ No newline at end of file
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