确定性算法查找:
print("输入一个数组")
list1 = list(input().split())
for i in range(len(list1)):
list1[i] = int(list1[i])
n = int(input("想要查找的数字\n"))
def findkey(left, right, key):
while right - left > 1:
mid = (right + left) // 2
if key < list1[mid]:
right = mid
elif key > list1[mid]:
left = mid
else:
return mid
#输出所查找数字在列表中位置
print(findkey(0, len(list1) - 1, n))
随机性算法查找:
import random
print("输入一个数组")
list1 = list(input().split())
for i in range(len(list1)):
list1[i] = int(list1[i])
key = int(input("想要查找的数字\n"))
num = random.randint(0, len(list1))
leng = len(list1)
def findkey(a):
if list1[a] < key:
return findkey(random.randint(a, leng))
elif list1[a] > key:
return findkey(random.randint(0, a))
else:
return a
#输出所查找数字在列表中位置
print(findkey(num))