def linearsearch(arr, x):
for i in range(len(arr)):
if arr[i] == x:
return i
return -1
arr = [1,2,3,4,5,6,7,8]
x = 4
print("element found at index "+str(linearsearch(arr,x)))def linear_search(a, key):
position = 0
flag = False
while position < len(a) and not flag:
if a[position] == key:
flag = True
else:
position = position + 1
return flagdef linear_search(lst, target):
"""Returns the index position of the target if found, else returns -1"""
for i in range(0, len(lst)):
if lst[i] == target:
return i
return -1def linear_search(lists, word):
for i in range(len(lists)):
if lists[i] == word:
return True
return False
A = [12, 34, 19, 43, 56, 12, 99, 23, 19, 26, 29, 56, 78, 53]
word = 4
index = A.index(word)
if linear_search(A, word):
print(f"Found at index {index}")
else:
print("Element Not Found")
#this is really basic, but it'll do
Array = [1,2,3,4,5,6,7,8] #example array
def LinearSearch(Array, SearchVal): #SearchVal= value you are looking for
for i in range(len(Array)):
if Array[i]== SearchVal:
return True
return False
#once it has looped through all of the array and hasn't found
#the search value, it will return False. def locate_card(cards, query):
# Create a variable position with the value 0
position = 0
# Set up a loop for repetition
while True:
# Check if element at the current position matche the query
if cards[position] == query:
# Answer found! Return and exit..
return position
# Increment the position
position += 1
# Check if we have reached the end of the array
if position == len(cards):
# Number not found, return -1
return -1