斐波納契數(shù)列代碼

# Fibonacci series: 斐波納契數(shù)列
# 兩個元素的總和確定了下一個數(shù)
a, b = 0, 1
while b < 1000:
    print(b, end=',')
    a, b = b, a+b

判斷素數(shù)(質(zhì)數(shù))代碼

for n in range(2, 20):
    for x in range(2, n):
        if n % x == 0:
            print(n, '等于', x, '*', n//x)
            break
    else:
        # 循環(huán)中沒有找到元素
        print(n, ' 是質(zhì)數(shù)')

判斷閏年代碼

#能被4整除,并且不能被100整除
#能被400整除的數(shù)
year = int(input('請輸入一個年份:'))
if(year % 4 == 0) and (year % 100 != 0) or (year % 400 == 0):
    print('{0}是閏年'.format(year))
else:
    print('{0}不是閏年'.format(year))

冒泡算法代碼

def bubbleSort(arr):
    n = len(arr)
 
    # 遍歷所有數(shù)組元素
    for i in range(n):
 
        # Last i elements are already in place
        for j in range(0, n-i-1):
 
            if arr[j] > arr[j+1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]
 
arr = [64, 34, 25, 12, 22, 11, 90]
 
bubbleSort(arr)
 
print ("排序后的數(shù)組:")
for i in range(len(arr)):
    print ("%d" %arr[i]),