python 二分法查找第k大_Python 二分法查找

# 二分法查找主要的作用就是查找元素

lst = [1,3,5,7,12,36,68,79] # 数据集 百万级数据

num = int(input("请输入你要查找的元素信息:"))

for el in lst:

if num == el:

print("存在")

break

else:

print("不存在")

len(lst)

# 0 1 2 3 4 5 6 7

# [1,3,5,7,12,36,68,79]

n = 28 # 3

# 规则. 掐头结尾取中间, 必须是有序序列,

# 100000000

# 二分法查找 (需要你明白和掌握)

lst = [1,3,5,7,12,36,68,79]

n = int(input("请输入一个数"))

left = 0

right = len(lst) - 1

while left <= right:

mid = (left + right)//2

if n > lst[mid]:

left = mid + 1

elif n < lst[mid]:

right = mid - 1

else:

print("存在")

break

else:

print("不存在")

# 递归

def func(n, lst):

left = 0</