w3resource

Python: Sequential search

Python Search and Sorting: Exercise-2 with Solution

Write a Python program for sequential search.
Sequential Search: In computer science, linear search or sequential search is a method for finding a particular value in a list that checks each element in sequence until the desired element is found or the list is exhausted. The list need not be ordered.

Sample Solution:

Python Code:

def Sequential_Search(dlist, item):

    pos = 0
    found = False
    
    while pos < len(dlist) and not found:
        if dlist[pos] == item:
            found = True
        else:
            pos = pos + 1
    
    return found, pos

print(Sequential_Search([11,23,58,31,56,77,43,12,65,19],31))

Sample Output:

(True, 3)

Flowchart:

Flowchart: Python Data Structures and Algorithms: Sequential search

Python Code Editor :

Contribute your code and comments through Disqus.

Previous: Write a Python program for binary search.
Next: Write a Python program for binary search for an ordered list.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://198.211.115.131/python-exercises/data-structures-and-algorithms/python-search-and-sorting-exercise-2.php