mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
Linear Search
This commit is contained in:
parent
b1b4bdaecd
commit
5db83095b3
28
LinearSearch.py
Normal file
28
LinearSearch.py
Normal file
|
@ -0,0 +1,28 @@
|
|||
def search_linear(x,y):
|
||||
n = len( x )
|
||||
for i in range(n):
|
||||
if theValue[i] == y:
|
||||
return True
|
||||
return false
|
||||
|
||||
def sequentialSearch(alist, item):
|
||||
pos = 0
|
||||
found = False
|
||||
|
||||
while pos < len(alist) and not found:
|
||||
|
||||
if alist[pos] == item:
|
||||
found = True
|
||||
print("Found")
|
||||
else:
|
||||
pos = pos+1
|
||||
if found == False:
|
||||
print("Not found")
|
||||
return found
|
||||
|
||||
print("Enter numbers seprated by space")
|
||||
s = input()
|
||||
numbers = list(map(int, s.split()))
|
||||
trgt =int( input('enter a single number to be found in the list '))
|
||||
sequentialSearch(numbers, trgt)
|
||||
|
Loading…
Reference in New Issue
Block a user