Given a bitonic sequence A of N distinct elements, write a program to find a given element B in the bitonic sequence in O(logN) time.
3 <= N <= 105
1 <= A[i], B <= 108
Given array always contain a bitonic point.
Array A always contain distinct elements.
First argument is an integer array A denoting the bitonic sequence.
Second argument is an integer B.
Return a single integer denoting the position (0 index based) of the element B in the array A if B doesn't exist in A return -1.
A = [3, 9, 10, 20, 17, 5, 1] B = 20
A = [5, 6, 7, 8, 9, 10, 3, 2, 1] B = 30
B = 20 present in A at index 3
B = 30 is not present in A
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.