Question: Which of the following C++ functions correctly implements binary search?
Options:
Correct Answer: int binarySearch(int arr[], int l, int r, int x)
Solution:
The function \'int binarySearch(int arr[], int l, int r, int x)\' is a correct implementation signature for binary search, taking the array, left index, right index, and the target value.