Python之冒泡排序

def bubble_sort(arr):
    n = len(arr)
    print("长度为",n)

    for i in range(n-1):
        # 每次遍历都会将最大值移动到右侧
        #print("此时i为",i,"，列表为：%s" % arr)

        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                #arr[j], arr[j+1] = arr[j+1], arr[j]
                x=arr[j+1]
                arr[j+1]=arr[j]
                arr[j]=x
            #print("此时j为",j,"，列表为：%s" % arr)
    
    return arr

#if __name__ == '__main__':   
arr = [54, 26, 93, 77, 44, 31, 44, 55, 20]
#print("原列表为：%s" % arr)
bubble_sort(arr)
print("新列表为：%s" % arr)

bubbleSort_test.py

import unittest
from bubbleSort import bubble_sort

class TestBubbleSort(unittest.TestCase):
 def test_bubble_sort(bubble_sort):
  print(bubble_sort([2,4,1,3,5,5]))