def sort_nums(nums: list):
    nums.sort(reverse=True)
    return nums


def fast_sort_nums(nums: list):
    # 快速排序
    if not nums:
        return []
    cur = nums.pop()
    smaller = [i for i in nums if i <= cur]
    bigger = [i for i in nums if i > cur]
    return fast_sort_nums(bigger) + [cur] + fast_sort_nums(smaller)


if __name__ == '__main__':
    print(fast_sort_nums([3, 6, 2, 7, 3, 9, 1, 96, 234, 5, 2]))
    print(fast_sort_nums([0]))
    print(fast_sort_nums([]))
    print(fast_sort_nums([3, 2, 1]))