This is a classic problem in computer science. Given a sorted array of integers and a target value, the goal is to find the index of the target value if it exists in the array, or to return -1 if it does not. This can be accomplished using a simple binary search algorithm.

This problem deals with determining if a given value is present in a sorted array. An example input is given as [1, 3, 5, 7], 5, with the expected output being true.

This problem deals with finding a target value in a sorted array using binary search. If the target value is found in the array, the index of that value is returned. If the target value is not found in the array, -1 is returned.

This problem deals with implementing a binary search algorithm to find the index of a given target value in a sorted array. If the target is not found, the function should return -1.

The problem is to find the index of a given target value in a sorted array of integers, using the binary search algorithm. If the target value is not present in the array, the function should return -1.

This problem deals with finding the index of an element in a sorted array of integers. The input is a sorted array of integers and an integer value to find. The output is the index of the value in the array, or -1 if the value is not present in the array.

Given a list of integers and a target sum, return the indices of the two numbers that add up to the target sum.

Given a list of integers, write a function that returns the index of the first integer that is greater than or equal to the given target. If there is no such integer, return -1 .