python之算法

n = 10
print(‘Hello World‘)    # 时间复杂度：O(1)
----------------------------------------------------------------
for i in range(n):
    print(‘Hello World‘)    # 时间复杂度：O(n)
----------------------------------------------------------------
for i in range(n):
    for j in range(n):
        print(‘Hello World‘)    # 时间复杂度：O(n^2)
----------------------------------------------------------------
for i in range(n):
    print(‘Hello World‘) 
    for j in range(n):
        print(‘Hello World‘)    # 时间复杂度：O(n^2)
----------------------------------------------------------------
for i in range(n):
    for j in range(m):
        print(‘Hello World‘)    # 时间复杂度：O(n^2)
----------------------------------------------------------------
for i in range(n):
    for j in range(n):
        for k in range(n):
            print(‘Hello World‘)    # 时间复杂度：O(n^3)
----------------------------------------------------------------
print(‘Hello Yesterday‘)
print(‘Hello Tomorrow‘)
print(‘Hello Today‘)     # 时间复杂度：O(1)

def Bubble(li):
    for i in range(len(li) - 1):
        for j in range(len(li) - 1 - i):
            if li[j] > li[j+1]:  # 判断前面一个数字是否大于后面的数字
                li[j], li[j+1] = li[j+1], li[j]   # 转换两数字之间的位置，将大的数字放后面


li = [3,2, 6, 4, 5, 8, 9, 7, 1, 10]
Bubble(li)   
print(li)