human
Find bitonic point in given bitonic sequence | Function to find bitonic point using binary search.
base condition to check if arr [ mid ] is bitonic point or not.
We assume that sequence is bitonic . We go to right subarray if middle point is part of increasing subsequence . Else we go to left subarray ..
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to find bitonic point in given bitonic sequence and the other steps required.
 def binarySearch ( arr , left , right ) :
	if ( left <= right ) :
		mid = ( left + right ) // 2 ;
		if ( arr [ mid - 1 ] < arr [ mid ] and arr [ mid ] > arr [ mid + 1 ] ) :
			return mid ;
		if ( arr [ mid ] < arr [ mid + 1 ] ) :
			return binarySearch ( arr , mid + 1 , right ) ;
		else :
			return binarySearch ( arr , left , mid - 1 ) ;
	return - 1 ;
arr = [ 6 , 7 , 8 , 11 , 9 , 5 , 2 , 1 ] ;
n = len ( arr ) ;
index = binarySearch ( arr , 1 , n - 2 ) ;
if ( index != - 1 ) :
	print ( arr [ index ] ) ;