Best Case: To find the key at the last index of the array arr[size-1]. .:. Complexity O(1).
Average Case: O(N).
Worst Case: To find the key at the first index of the array arr[0], as we started searching from the end of the array. .:. Complexity O(N).