Help me write a bubble sort algorithm from 0 to 100

Ok, here is a bubble sort algorithm that sorts numbers from 0 to 100 in ascending order:

def bubble_sort(numbers):
    n = len(numbers)
    
    for i in range(n):
        # 标记是否发生数据交换
        swapped = False
        
        for j in range(0, n - i - 1):
            if numbers[j] > numbers[j + 1]:
                # 交换两个数的位置
                numbers