19. Java Sequential / Linear Search

Java Sequential / Linear Search
A sequential or linear search algorithm is a very simple method to find a particular element in an array. It is considered to be the simplest search algorithm The implementation of this algorithm does not require the use of ordered elements (sorted arrays).
Linear Search 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.
Advantages of Linear Search:
Linear search can be used irrespective of whether the array is sorted or not. It can be used on arrays of any data type.
Does not require any additional memory.
It is a well-suited algorithm for small datasets.
Drawbacks of Linear Search:
Linear search has a time complexity of O(N), which in turn makes it slow for large datasets.
Not suitable for large arrays.