This is a Linear Time Search Algorithm In this Algorithm we traverse from first element to the last element to search for the given key by comparing the current element with the key If we get the key we return the index of the found element In Best Case this algorithm works in O(1) time complexity and in Worst Case this works in O(n)