What is binary search?
Binary search is a commonly used algorithm in computer science and mathematics to efficiently locate a specific value within a sorted array or list. It follows a divide and conquer approach by repeatedly dividing the search space in half to narrow down the possible positions of the target value. Since it operates on a sorted collection, it compares the middle element with the target and eliminates half of the remaining elements in each iteration. This process continues until the target is found or the search space is exhausted. Binary search has a time complexity of O(log n) and is significantly faster than linear search, especially for large datasets.
This mind map was published on 6 August 2023 and has been viewed 107 times.
