chap5

def hire_assistant(A,n):
    best=0
    for i in range(0,n):
        x=A[i]
        if A[i]>best:
            best=i
    return best
def online_max(A,k,n):
    infinity=1000000
    best=-infinity
    for i in range(0,k):
        if A[i]>best:
            best=A[i]
    for j in range(k,len(A)):
        if A[j]>best:
            return j
    return n-1
def random_search(A,x):
    from random import randint
    searched=set()
    while(len(searched)!=len(A)):
        i=randint(0,len(A)-1)
        if(A[i]==x):
            return i
        searched.add(i)
    return -1
A=[1,2,3,4,5]
print(random_search(A,20))