def LinearSearch(l,n,v):
    i=0;
    answer=-1;
    while i<n:
        if (l[i]==v):
            answer=i;
    return answer
def BetterLinearSearch(l,n,v):
    i=0
    while i<n:
        if (l[i]==v):
            return i
        i=i+1
    return "Not Founded"
def SentinelLinearSearch(l,n,v):
    i=0
    last=l[n-1]
    l[n-1]=v
    while l[i]!=v:
        i=i+1
    l[n-1]=last
    if i<n or l[n-1]==v:
        return i
    return "Not Founded"
def RecursiveLinearSearch(l,n,i,x):
    if i>n-1:
        return "NotFound"
    else:
        if (l[n-1]==x):
            return i
        if (l[i]!=x):
            return RecursiveLinearSearch(l,n-1,i+1,x)

list =[1,2,3,4,5,6,7,8,9,10]
n = len(list)
print("Linear Search Our Element is " + str(BetterLinearSearch(list,n,4)));
print("BetterLinear Search Our Element is " + str(BetterLinearSearch(list,n,11)));
print("SentinelLinearSearch is " + str(SentinelLinearSearch(list,n,6)))
print("RecursiveLinearSearch is " + str(RecursiveLinearSearch(list,n,0,6)))