what is binary searching? explain it
Answers
Answered by
2
Answer:
A binary search is a quick and efficient method of finding a specific target value from a set of ordered items. By starting in the middle of the sorted list, it can effectively cut the search space in half by determining whether to ascend or descend the list based on the median value compared to the target value.
Answered by
4
Answer:
Search a sorted array by repeatedly dividing the search interval in half . Begin with an interval covering the whole array. If the value of the search key is less than item in the middle of the interval, narrow the interval to the lower half.
Similar questions