GitHub - prithvi733/Search-Algorithms
To write a program to perform linear search and binary search using python programming.
i) Use a linear search method to match the item in a list.
def linearsearch(array,n,k):
for i in range(0,n):
if(array[i]==k):
return i
return -1
array = eval(input())
k=eval(input())
n=len(array)
array.sort()
result = linearsearch(array,n,k)
if(result==-1):
print(array)
print("Element not found")
else:
print(array)
print("Element found at index: ",result)
ii) Find the element in a list using Binary Search(Iterative Method).
def linearsearch(array,n,k):
for i in range(0,n):
if(array[i]==k):
return i
return -1
array = eval(input())
k=eval(input())
n=len(array)
array.sort()
result = linearsearch(array,n,k)
if(result==-1):
print(array)
print("Element not found")
else:
print(array)
print("Element found at index: ",result)
iii) Find the element in a list using Binary Search (recursive Method).
def BinarySearch(arr, k, low, high):
if high>=low:
mid=low+(high-low)//2
if arr[mid]==k:
return mid
elif arr[mid]>k:
return BinarySearch(arr,k,low,mid-1)
else:
return BinarySearch(arr,k,mid+1,high)
else:
return -1
arr=eval(input())
arr.sort()
k=eval(input())
result = BinarySearch(arr,k,0,len(arr)-1)
if(result==-1):
print(arr)
print("Element not found")
else:
print(arr)
print("Element found at index: ",result)
Thus the linear search and binary search algorithm is implemented using python programming.