def greedy(list_):
    """
    Divide elements into two approximately equal subsets
    with a "greedy" algorithm. Order the elements then assign elements
    to the smallest subset.

    .. warning::
        A "greedy" algorithm may not return the optimal solution.

    :param list_: A list of positive numbers
    :type list_: list

    :returns: Minimum difference between sums of subsets
    :rtype: float

    :Example:

    >>> greedy(example_list)
    8.46
    """
    list_ = sorted(list_, reverse=True)
    diff = 0.0
    for item in list_:
        if diff <= 0.0:
            diff += item
        else:
            diff -= item
    return abs(diff)
