


'''simple docstring'''
# Algorithm for the pigeonhole sorting







def    a__			(   lowerCAmelCase__		)       ->      Union[str, Any]:
    UpperCAmelCase__     :						str						=							min(lowerCAmelCase__		)  # min() finds the minimum value
    UpperCAmelCase__     :						Dict						=							max(lowerCAmelCase__		)  # max() finds the maximum value

    UpperCAmelCase__     :						Tuple						=							max_val - min_val + 1  # size is difference of max and min values plus one

    # list of pigeonholes of size equal to the variable size
    UpperCAmelCase__     :						List[Any]						=							[0] * size

    # Populate the pigeonholes.
    for x in a:
        assert isinstance(lowerCAmelCase__    ,   lowerCAmelCase__		), "integers only please"
        holes[x - min_val] += 1

    # Putting the elements back into the array in an order.
    UpperCAmelCase__     :						int						=							0
    for count in range(lowerCAmelCase__		):
        while holes[count] > 0:
            holes[count] -= 1
            UpperCAmelCase__     :						str						=							count + min_val
            i += 1





def    a__			(   )       ->      Dict:
    UpperCAmelCase__     :						List[Any]						=							[8, 3, 2, 7, 4, 6, 8]
    pigeonhole_sort(lowerCAmelCase__		)
    print('''Sorted order is:'''    ,   ''' '''.join(lowerCAmelCase__		)		)


if __name__ == "__main__":
  main()




a			:			Any												=					[
    '''Audio''',
    '''Array2D''',
    '''Array3D''',
    '''Array4D''',
    '''Array5D''',
    '''ClassLabel''',
    '''Features''',
    '''Sequence''',
    '''Value''',
    '''Image''',
    '''Translation''',
    '''TranslationVariableLanguages''',
]
from .audio import Audio
from .features import ArrayaD, ArrayaD, ArrayaD, ArrayaD, ClassLabel, Features, Sequence, Value
from .image import Image
from .translation import Translation, TranslationVariableLanguages


