Linear and Binary Searching
Two techniques are available for searching an element: Binary Search and Linear Search. All we have to do is search for that key in the array since we have provided an array and a key value to each of these functions. If we locate that key value, we will return the index value that goes with it. We will print the message "Value not found" if we are unable to locate that key in the array.
Linear Searching
A technique for finding an element in a group of elements is called linear search. To locate the desired element, a sequential visit is made to each element in the collection one at a time using linear search. Another name for linear search is sequential search.
How Do Algorithms for Linear Search Work
Regarding the Linear Search Algo:
- Each element is regarded as a possible match for the key and is examined to confirm this.
- The search is successful and the element's index is returned if any element is discovered to be equal to the key.
- "No match found" appears in the search results if no element matching the key is found.
Steps of Linear Search Algorithm
The following steps comprise the linear search algorithm breakdown:
Step 1: Start with the first item in the group of elements.
Step 2: Make a comparison between the intended and current elements.
Step 3: Return true or the index to the current element if the current element and the desired element are equal. If not, proceed to the following item in the collection.
Step 4: Continue steps 2-4 until the collection is complete.
Step 5: Return that the sought element is not in the array if the collection is exhausted without locating it.
Binary Searching
An algorithm called binary search is used to locate a target value in a sorted array. Until the goal value is found or the interval is empty, it operates by halving the search interval periodically. By comparing the target element with the search space's middle value, the search interval is cut in half.
How Do Algorithms for Binary Search Work
Binary searches are effective algorithms that work by recursively dividing an array in half until the element is found or the list is reduced to one piece that doesn't match the required element. They are based on the "divide and conquer" theory.
- Start with a time interval that encompasses the whole array.
- Narrow the interval to that bottom half if the search key value is smaller than the item in the middle of the interval. If not, restrict the range to the upper half.
- Until the value is found or the interval is empty, keep checking the selected interval.
The Binary Search Algorithm's Steps
The detailed Binary Search method is provided below:
Step 1: Determine the middle index, to split the search space in half.
Step 2: Compare the key and the search space's center element.
Step 3: The procedure is finished if the key is located at the middle element.
Step 4: Select which half will be the next search space if the key is not located at the center element.
- The left side is used for the subsequent search if the key is smaller than the center element.
- The right side is used for the subsequent search if the key is larger than the center element.
Step 5: Until the key is located or the entire search space is used up, this process is repeated.
