2021年5月4日 星期二

Linear Search (線性搜尋)

 複雜度  O(n)

Linear Search 又叫 Sequential Search

linearlist=[10,20,30,40,50]
found=False
for i in range(len(linearlist)):
    if linearlist[i]==50:
        print("數字{}是在裡面".format(linearlist[i]))
        found=True
        break
if not found:
         print("數字{}不是在裡面".format(linearlist[i]))


<定義一個linear search 函式>
def linear_search(data,value):
    for i in range(len(data)):
        if data[i]==value:
            return i
    return -1
list01=[10,20,30,40,50]
found=linear_search(list01,40)
if found==(-1):
    print("該值沒在此list內")
else:
    print("此{}在list內".format(list01[found]))

沒有留言:

張貼留言

二維陣列(2d array) matrix

import numpy as np fru_items=[["apple","banana","cherry","durian","eggplant","fig...