def find_rotation_count(A):
    if not A:
        return 0
    
    left = 0
    right = len(A) - 1
    
    while left <= right:
        # Array is already sorted (no rotation in this segment)
        if A[left] <= A[right]:
            return left
        
        mid = (left + right) // 2
        next_mid = (mid + 1) % len(A)
        prev_mid = (mid - 1) % len(A)
        
        # Check if mid is the minimum element
        if A[mid] <= A[next_mid] and A[mid] <= A[prev_mid]:
            return mid
        
        # Decide which half to search
        if A[mid] >= A[left]:
            left = mid + 1
        else:
            right = mid - 1
    
    return 0