问题描述：
c++ 这题什么意思?怎么写?
// Recursive binary search via pointers. If the target is found, return a pointer to it. // Otherwise return NULL.template
int * binarySearch(T * firstPtr, T * lastPtr, const T &target);// Top-level binary search function. Calls the function above.
// Return index of target in values or -1, if target isn't found.template int binarySearch(T values[], int size, const T &target) { int * loc = binarySearch(values, values+size-1, target); return loc == NULL ? -1 : loc-values;
}
// Recursive binary search via pointers. If the target is found, return a pointer to it. // Otherwise return NULL.template
int * binarySearch(T * firstPtr, T * lastPtr, const T &target);// Top-level binary search function. Calls the function above.
// Return index of target in values or -1, if target isn't found.template int binarySearch(T values[], int size, const T &target) { int * loc = binarySearch(values, values+size-1, target); return loc == NULL ? -1 : loc-values;
}
问题解答：
我来补答展开全文阅读