python简单算法

目录

冒泡排序

九九乘法表

斐波那契额数列

---

冒泡排序

def bubble_sort(arr):
    for i in range(len(arr)):
        for j in range(0, len(arr)-i-1):
            if arr[j] > arr[j+1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]
 
arr = [3, 2, 0, 7, 4]
bubble_sort(arr)

九九乘法表

for i in range(1,10):
    for j in range(1,i+1):
        print("%d*%d=%d"%(i,j,i*j),end=" ")
        print("")

斐波那契额数列

def fibo(num):
    a = 0
    b = 1
    current_index = 0
    while current_index < num:
        result = a
        a, b = b, a + b
        current_index += 1
        yield result

f = fibo(1000)
for value in f:
    print(value)