Count of smaller or equal elements Python

PROGRAM TO COUNT THE NUMBER OF SMALLER OR EQUAL ELEMENTS IN SORTED ARRAY

def binarySearchCount(arr, n, key):

  

    left = 0

    right = n - 1

  

    count = 0

  

    while (left <= right): 

        mid = int((right + left) / 2)

  

        # Check if middle element is

        # less than or equal to key

        if (arr[mid] <= key): 

  

            # At least (mid + 1) elements are there

            # whose values are less than

            # or equal to key

            count = mid + 1

            left = mid + 1

          

        # If key is smaller, ignore right half

        else:

            right = mid - 1

      

    return count

  

# Driver code

arr = [ 1, 2, 4, 11, 11, 16 ]

key = 11

n = len(arr)

  

print( binarySearchCount(arr, n, key))




OUTPUT

5

CREDITS: https://www.geeksforgeeks.org/count-smaller-equal-elements-sorted-array/