Problem: Given an array arr of n elements, write a function to search a given element x in arr.
Element found at position 1
The time complexity of the above algorithm is O(n).
Please refer complete article on Linear Search for more details!
My Personal Notes arrow_drop_up
- Java Program for Linear Search
- Linear Search vs Binary Search
- Linear Search
- Linear search using Multi-threading
- C Program for Anagram Substring Search (Or Search for all permutations)
- Lex program to search a word in a file
- C Program for Binary Search (Recursive and Iterative)
- Recursive program to linearly search an element in a given array
- Repeatedly search an element by doubling it after every successful search
- Why is Binary Search preferred over Ternary Search?
- Interpolation search vs Binary search
- Best First Search (Informed Search)
- Median of two sorted arrays of different sizes | Set 1 (Linear)
- Meta Binary Search | One-Sided Binary Search
- Sublist Search (Search a linked list in another list)