```python
def find_rotation_count(A):
    """
    Finds the number of rotations in a circularly sorted array.
    The number of rotations is the index of the minimum element.
    """
    list_size = len(A)

    # Handle the edge case of an empty list.
    if list_size == 0:
        return 0

    # Initialize pointers for binary search.
    low = 0
    high = list_size - 1

    # Perform a modified binary search to find the minimum element's index.
    while low < high:
        # Calculate the middle index.
        mid = low + (high - low) // 2

        # The core logic compares the middle element with the element at the high end
        # to decide which half of the array contains the minimum element.
        if A[mid] > A[high]:
            # If A[mid] is greater than A[high], the minimum element must be
            # in the right half of the current search space.
            low = mid + 1
        elif A[mid] < A[high]:
            # If A[mid] is less than A[high], the minimum element is either
            # A[mid] itself or in the left half.
            high = mid
        else:
            # If A[mid] is equal to A[high], duplicates are present.
            # We cannot definitively know which half contains the minimum.
            # The safest approach is to shrink the search space from the right.
            high -= 1

    # When the loop terminates, 'low' and 'high' converge on the index
    # of the minimum element, which is the rotation count.
    return low

```