Linear Search Implementation in Python

We all know that a linear search is a search algorithm. The implementation code of this algorithm is everywhere. But I want to organize this on my site.

The complexity of this algorithm.

Worst Complexity: O(n)
Average Complexity: O(n)
Best Complexity: O(1)
Space Complexity: O(1)

def search(lst, n):
	for i in range(len(lst)):
		if lst[i] == n:
			return i
			break
	
	return None

print(search([15, 225, 122, 10, 25, 32, 99, 100, 11, 5], 10)) # Result = 3

Related posts:

  1. Binary Search Implementation in Python
  2. Selection Sort Implementation in Python
  3. Insertion Sort Implementation in Python
  4. Linked List – Code Snippet
  5. Implementation of Stack Using Linked List and List – Code Snippet

Tags:

January 21, 2020 by Code Snippets
Ibrahim Hasnat
I am an ordinary self-taught computer programmer. Programming is something I like most. It’s fascinating to me.