
    Design a function that analyzes user compatibility scores in a social network to identify potential conflicts in friend recommendations by counting the number of times a user with higher compatibility appears after a user with lower compatibility in the network sequence. The count of such instances helps determine how many friend recommendation adjustments are needed to create more harmonious social connections.
    

    
def get_Inv_Count(arr):
    """
    Design a function that analyzes user compatibility scores in a social network to identify potential conflicts in friend recommendations by counting the number of times a user with higher compatibility appears after a user with lower compatibility in the network sequence. The count of such instances helps determine how many friend recommendation adjustments are needed to create more harmonious social connections.
    

    """
def get_Inv_Count(arr):
    """
    Design a function that analyzes user compatibility scores in a social network to identify potential conflicts in friend recommendations by counting the number of times a user with higher compatibility appears after a user with lower compatibility in the network sequence. The count of such instances helps determine how many friend recommendation adjustments are needed to create more harmonious social connections.
    

    """
    inv_count = 0
    for i in range(len(arr)):
        for j in range(i + 1, len(arr)):
            if arr[i] > arr[j]:
                inv_count += 1
    return inv_count