Binary Search Algorithm: Function, Benefits, Time & Space Complexity

By Author: shashi
Total Articles: 132
Comment this article

Binary Search Algorithm: Function, Benefits, Time & Space Complexity

A binary search algorithm is based on the principle of always skipping over half of the list. When searching for a specific value in a list, it will repeatedly divide the list into smaller sublists until it locates it. To quickly improve upon a basic linear search algorithm, one can use a binary search algorithm. This article will discuss the functioning and benefits of binary search algorithms and discuss time and space complexity.

How a binary search algorithm works
To begin, remember that a binary search algorithm can only be applied to a sorted list. Therefore, sorting the provided list is the obvious starting point. After the list has been sorted, the median is compared to the target number. The central index is returned as an answer if the sought-after value coincides with its value. Toss the right side of the list if the goal is less than the central index's bargain. We only use the right half of the result if the central index value is smaller than what we need. The method is then applied to the remaining items ...
... on the shorter lists until the desired value is located.

Example 1
Let's have a look at an example of the algorithm in action. Let's pretend there's a list with these digits on it:
1, 15, 23, 7, 6, 14, 8, 3, 27

Our goal, then, will be set at 27. All told, there are nine items on the list.

Initially, you should sort the list. Sorted, the list might look like this:
1, 3, 6, 7, 8, 14, 15, 23, 27

Nine items in the list make five the most central index. The fifth index value is 8, hence the expression is true. In this case, the desired 27 is compared to the actual 8. See if the value is more than or equal to 8. Is this the case? If so, return the index and leave the program.

Since 27 is more than 8, we may safely skip over the first eight items on the left side of the list. The new list to traverse: 14, 15, 23, 27

Be aware that the list is not shortened in practice. This restriction applies just to the scope of the observation. A "new list" does not mean that the old list has been shortened or that a new list has been created. Although doable with a new list, there are two issues with doing so.

There will first be a memory cost. The growing complexity of lists will require more storage space. Also, each loop requires keeping tabs on the original indexes.

Depending on the specifics of the implementation, the new central index may be treated as either the second or third component. In this case, we shall focus on the third factor. Value 27 is used as a comparison point for 23. The left half will be thrown out because the value is higher than average. The list to traverse: 27.

Since there is only one item on the list, that one item will serve as the focus. So, we check if 27 is closer to the target. Since they are equivalent, we'll give you back index 27 from the original set.

Example 2
Let's say that, from the same set of options, 2 is the one you're after.
As a starting point, we compare the central value, eight, to the middle number, two. Since the target is less than the average, we look further down the list, to the left.
The updated pathfinding will include:
1, 3, 6, 7
Let's make the keystone our second pillar. In this case, the preferred value of 2 is compared to 3. Considering the current value, we once again concentrate on the items on the left side of the preceding sentence.
To recap, the new traversal will include: 1
Since there is only one item left in the traversing list, the value is compared to it directly. These numbers are wrong. As a result, we exit the while loop with the message "value not found."

Time and Space Complexity
The best and worst-case scenarios of binary search are often misunderstood. The binary search algorithm has a time complexity of O(log(n)) (log n). In an ideal scenario, the time complexity would be O(1) if the value in the center index exactly matched what was needed.

Comparatively, the worst-case scenario for a binary search is different. Extreme or non-existent values on the list could represent the worst-case situation.

The worst-case complexity of a binary search has values that are either at the very beginning or the very end of a list. Learn how to calculate the worst-case complexity of a binary search with the help of a brief explanation that follows.

The recurrence relation for binary search is T(n)=T(n/2)+1.
Using the master theorem, we find that the complexity of performing a binary search in time is O(log n) (log n).

While the worst-case complexity of a binary search can be computed more quickly, it is generally overly pessimistic. However, the average complexity of binary search algorithms is another sort of binary search time complexity analysis that is rarely used.

Average complexity is avoided in binary search algorithms because it is more difficult to compute and requires in-depth information on how much data has been spread.

Benefits
Implementing a search algorithm is not too difficult, and a binary search algorithm is one of the simplest. It's a huge step up from linear search and almost as effective as more complicated search algorithms. Instead of sequentially searching through the list, the binary search algorithm halves the list on each iteration. This strategy shines when applied to lengthy lists.

Closing Remarks
We've reached the final parts of the article. If you liked the topic and are interested in the tech field, data science is the best option. Skillslash can help you there with the Data Science Course In Hyderabad with a placement guarantee. Contact the support team to know more.