Time and Space Complexity of Linear Search Algorithm
Time Complexity:
- Best Case: In the best case, the key might be present at the first index. So the best case complexity is O(1)
- Worst Case: In the worst case, the key might be present at the last index i.e., opposite to the end from which the search has started in the list. So the worst-case complexity is O(N) where N is the size of the list.
- Average Case: O(N)
Auxiliary Space: O(1) as except for the variable to iterate through the list, no other variable is used.
Introduction to Linear Search Algorithm
Linear Search Algorithm is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set. In this article, we will learn about the basics of Linear Search Algorithm, Applications, Advantages, Disadvantages, etc. to provide a deep understanding of Linear Search.
Table of Content
- What is Linear Search Algorithm?
- Algorithm for Linear Search Algorithm
- How Does Linear Search Algorithm Work?
- Implementation of Linear Search Algorithm
- Time and Space Complexity of Linear Search Algorithm
- Applications of Linear Search Algorithm
- Advantages of Linear Search Algorithm
- Disadvantages of Linear Search Algorithm
- When to use Linear Search Algorithm?
- Frequently Asked Questions (FAQs) on Linear Search Algorithm
Contact Us