Let’s understand the difference between linear search and binary search using a suitable example below: Problem The worst case time complexity is O(log n).Įxamples of Linear Search and Binary Search Only single dimensional array can be used. Single and Multidimensional arrays can be used. The elements in the array can be in random order.Įlements in the array need to be in sorted order. The three cases that are used in the binary search:Įlements are searched in a sequential manner (one by one).Įlements are searched using the divide-and-conquer approach. Check from the second point repeatedly until the value is found or the array is empty.If the target element is greater than the middle element, then continue the search in the right half.Else check if the target element is lesser than the middle element, then continue the search in the left half.If the middle element value matches the target element then return the index of the middle element.Start with the middle element of the array as a current key.The binary search algorithm uses the divide-and-conquer approach, it does not scan every element in the list, it only searches half of the list instead of going through each element, Hence said to be the best searching algorithm because it is faster to execute as compared to Linear search.

Search is considered successful only if it matches the target. In this method, the element that has to be searched is compared to the array's middle element. The Binary search method is only suitable for searching in a sorted array.

If still unable to find the target, return -1.

If not, move on to the next one until we reach the very end of an array.

If the current element matches the target element, return the position of the current element.

Start with the first position and compare it to the target in order to search for a target element.

Assume we need to find an element that is in an array in random order.This method can only be suitable for searching over a small array or an unsorted array. In this search, an array is sequentially traversed from the first element until the element is found or the end of the array is reached. There are two types of searching algorithmsĪ linear search, sometimes referred to as a sequential search, simply scans each element one at a time. If the element being searched for is found in the list, the search is considered successful otherwise, it is considered unsuccessful. In any data structure where any element is stored, search algorithms are made to check or retrieve that element. Introduction to Searches in Data Structuresįinding a given element's occurrence in a list is the process of searching. A binary search, on the other hand, finds the list's middle element recursively until the middle element matches a searched element.

In a linear search, each element in the list is searched one after the other in a sequential manner until it is found in the list. As a developer, you should be aware of the basic computer science concept of search algorithms such as linear search and binary search.

Sequential search in data structure