Sedin Technologies Engineer Interview Questions and Answers

Program for binary search

• Binary search is an efficient algorithm to search for an element in a sorted array

• It works by repeatedly dividing the search space in half

• If the middle element is the target, the search is successful

• If the target is smaller, search the left half; if larger, search the right half

• Continue dividing until the target is found or the search space is empty