【LeetCode】顺序查找（Python版）

一、顺序查找

顺序查找属于静态查找。因为顺序查找是按照从头到尾的方法查找特定数，所以也可以不对数列进行排序，直接开始查找。为了样式的统一，这里还是采用了有序的数列。以iList数列为例，顺序查找最坏的情况需要查找len(iList)次才能找到目标或者确认数列中没有目标。

二、界面输出显示

三、代码实现

import random
import timeit

def randomList(n):
    iList = []
    for i in range(n):
        iList.append(random.randrange(0,1000))
    return iList
def quicksort(iList):
    if(len(iList)<=1):
        return iList
    left = []
    right = []
    for i in iList[1:]:
        if i<=iList[0]:
            left.append(i)
        else :
            right.append(i) 
    return quicksort(left)+[iList[0]]+quicksort(right)
def sequentialSearch(iList,key):
    #print("iList is: %s" %str(iList))
    #print("find the number: %d" %key)
    ilen = len(iList)
    for i in range(ilen):
        #print(iList[i])
        #print(key)
        if iList[i] == key:
            return i
            #print(i)
    return -1
if __name__ == "__main__":
    iList = randomList(20)
    keys=[random.choice(iList),random.randrange(min(iList),max(iList))]
    for key in keys:
        num = sequentialSearch(iList,key)
        if(num>=0):
            print("%d number is %d\n"%(key,num))
        else:
            print("%d the key number is not find\n"%key)
    #print(timeit.timeit("selectsort(iList)","from __main__ import selectsort,iList",number=100))