Linear Search Algorithm Python. 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. This is also known as sequential search.
Here in this technique i compare. 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 return 1.
It is worst searching algorithm with worst case time complexity o n.
The linear search algorithm iterates through the sequence one item at a time until the specific item is found or all items have been examined. Here in this technique i compare. For example if a list l is initialized as l 10 8 2 7 3 4 9 1 6 5. It is worst searching algorithm with worst case time complexity o n.
