【算法】查找算法介绍

1.百钱买百鸡问题

import time
# 01百钱买百鸡
a = input('input a number:')    # i的单价20
b = input('input a number:')    # j的单价33

t1 =time.time()
for i in range(1,int(a)):
    for j in range(1,int(b)):
        for k in range(3,99,3):
            if (i + j +k == 100) and (i*5+j*3+k/3==100):
                print(i,j,k)
t2 =time.time()
print(((t2-t1)*1000))

• input （）函数返回的结果为字符串形式，如需比较或其他使用，需转换成相应的类型。

a = input('input a number:')    # i的单价20
print(type(a))      # <class 'str'>
a = int(input('input a number:'))    # i的单价20
print(type(a))      # <class 'int'>

2.测试时间复杂度问题

# 02测试时间复杂度
for i in range(1,1000):
    for j in range(1,1000):
        # for k in range(1,1000):    # 复杂算法
        k = 1000-i-j                 # 优化后算法
        if i+j+k == 1000 and i**2 +j**2 == k**2:
            print(i,j,k)

t2 =time.time()
print(((t2-t1)*1000))

"""
折半查找算法[二分查找]
优点：查找速度快
缺点：只适用于已排序好的数列
"""

# def erf_find (list):
#     if (len(list) % 2) != 0:
#         print('奇数列表中位数',list[len(list) // 2])
#     else:
#         print('奇数列表中位数前',list[(len(list) // 2) - 1])
#         print('奇数列表中位数后',list[(len(list) // 2)])
# list = [1,2,3,4,5]
# erf_find(list)

def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = (low + high)
        guess = list[mid]
        if guess == item:
            return mid
        if guess > item:
            high = mid - 1
        else:
            low = mid + 1
    return None

my_list = [1, 3, 5, 7, 9]
print(binary_search(my_list, 7))

"""
插补查找算法
优点：比折半查找范围小，速度快
mid=low+int((num-data[low])*(high-low)/(data[high]-data[low]))#用插补查找核心 计算出边界位置

low：最左侧数据索引
high：最右侧数据索引
num：目标数据
data[low]：最左侧数据
data[high]：最右侧数据
"""

def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = low + int((item - list[low]) * (high - low) / (list[high] - list[low]))
        print(mid)
        # mid = (low + high)
        guess = list[mid]
        if guess == item:
            return mid
        if guess > item:
            high = mid - 1
        else:
            low = mid + 1
    return None

t1 = time.time()
my_list = [12, 45, 56, 66, 77, 80, 97, 101, 120]
print(binary_search(my_list, 66))
t2 = time.time()
ms = t2 - t1
print("Inference: {} ms per batch image".format(ms))