Question

why binary search is better than linear search​

Answer 1

Answer:

Binary search. Binary search is more efficient than linear search; it has a time complexity of O(log n). The list of data must be in a sorted order for it to work. A binary search works by finding the middle element of a sorted array and comparing it to your target element.

Explanation:

Hope it helps you

Please mark me as brainliest

Answer 2

Answer:

Binary search. Binary search is more efficient than linear search; it has a time complexity of O(log n). The list of data must be in a sorted order for it to work. A binary search works by finding the middle element of a sorted array and comparing it to your target element.