Design an algorithm to efficiently search for a target element in a reverse-sorted array. Implement a function that takes the reverse-sorted array and the target value as inputs, returning the index of the target if found, or -1 if the target is not present in the array. Optimize the solution for time complexity.
