a binary search algorithm searches for a target value within a sorted array. binary search compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until the target value is found or until a search can no longer be performed. this problem can be solved using which of the techniques?