Linear Search in Under 60 Seconds

In this video, I will explain the Linear Search algorithm in under 60 seconds. This algorithm searches an array for a given item and typically returns the index if it is found. This algorithm has a worst-case time-complexity of O(n) meaning it is not particularly efficient and algorithms such as Binary Search are often preferred for implementation. This algorithm is sometimes known as sequential search.

#linearsearch #dsa #datastructures #algorithm #computerscience #programming #searchalgorithm