Python
def swap(arr:list, i:int, j:int):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
def bubbleSort(arr:list):
n = len(arr) - 1
while n >= 1:
for i in range(n):
if arr[i] > arr[i+1]: swap(arr, i, i+1)
n -= 1 #避免不必要的比較,因為第一次執行後最末端的值是最大
data = [5,3,8,6,7,2]
bubbleSort(data)
print(data) #[2,3,5,6,7,8]