def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))def LinearSearch(lys, element):
for i in range (len(lys)):
if lys[i] == element:
return i
return -1
So if we use the function to compute:
>>> print(LinearSearch([1,2,3,4,5,2,1], 2))