python-算法

1、冒泡算法

def bubble_sort(lists):

    count = len(lists)

    for i in (0,count):

        for j in (i+1,count):

            if lists[i] > lists[j]:

                lists[i] , lists[j] = lists[j] , lists[i]

    return lists


lists = [8,2,4,1,5,7,3]
bubble_sort(lists)
print(lists)

2、判断是否为质数

def is_prime(n):
    if n <= 1 :
        return False
    for i in range(2,n):
        if n % i == 0:
            return False
    return True

for i in range (0,97):
    if is_prime(i):
        print(i)