find last occurance of a number in a sorted array increasing order approach binary search tn olog n returns the index of the last occurance of the given element in an array the array has to be sorted in increasing order returns the index of the last occurance of the given element in an array the array has to be sorted in increasing order
def last_occurrence(array, query):
    
    low, high = 0, len(array) - 1
    while low <= high:
        mid = (high + low) // 2
        if (array[mid] == query and mid == len(array)-1) or \
           (array[mid] == query and array[mid+1] > query):
            return mid
        if array[mid] <= query:
            low = mid + 1
        else:
            high = mid - 1