Linear Search in Python Program

In this article, we will learn about the Linear Search and its implementation in Python 3.x. Or earlier.

Algorithm

• Start from the leftmost element of given arr[] and one by one compare element x with each element of arr[]

• If x matches with any of the element, return the index value.

• If x doesn’t match with any of elements in arr[] , return -1 or element not found.

Now let’s see the visual representation of the given approach −

Example

 Live Demo

def linearsearch(arr, x):
   for i in range(len(arr)):
      if arr[i] == x:
         return i
   return -1
arr = ['t','u','t','o','r','i','a','l']
x = 'a'
print("element found at index "+str(linearsearch(arr,x)))

Here we linearly scan the list with the help of for loop.

Output

element found at index 6

The scope of the variables are shown in the figure −

Conclusion

In this article, we learnt about the mechanism of linear search in Python3.x. Or earlier

Pavitra

Published on 26-Sep-2019 08:09:33

• Related Questions & Answers
• Python Program for Linear Search
• Write a program for Linear Search in Python
• Linear Search
• Java program to implement linear search
• 8085 Program to perform linear search
• C/C++ Program for Linear Search?
• Linear search in Java.
• Program to perform linear search in 8085 Microprocessor
• Linear search on list or tuples in Python
• Implementing Linear Search in JavaScript
• Difference Between Linear Search and Binary Search
• Linear search using Multi-threading in C
• C++ Program to Find Minimum Element in an Array using Linear Search
• Python Program for Binary Search
• Python Program for Anagram Substring Search