python的最大公约数、最小公倍数和冒泡排序

最大公约数：

def function1 (num1,num2):
    g = []
    for i in range(1,max(num1,num2)):
        if num1 % i == 0 and num2 % i == 0:
            g.append(i)
            pass
    return max(g)

  

最小公倍数：

def function2(num1,num2):
    b = []
    for i in range(1,(num1 * num2)+1):
        if i % num1 == 0 and i % num2 == 0:
            b.append(i)
            break
    return b

冒泡排序：

num = [2,1,4,5,1,7,5,6,9,8]
def function3(num):
    L = len(num)
    for i in range(L-1):
        for j in range(L - i - 1):
            if num[j] > num[j+1]:
                num[j],num[j+1] = num[j+1],num[j]
    return num