很难理解为什么反向排序没有考虑100

def reverse_sort(numbers):
    n = len(numbers)
    for i in range(n):
        for j in range(0, n-i-1):
            if numbers[j] < numbers[j+1]:
                numbers[j], numbers[j+1] = numbers[j+1], numbers[j]
    return numbers

def reverse_sort(strings):
    if len(strings) <= 1:
        return strings
    pivot = strings[0]
    less = [x for x in strings[1:] if x > pivot]
    greater = [x for x in strings[1:] if x <= pivot]
    return reverse_sort(less) + [pivot] + reverse_sort(greater)