for循環(huán)優(yōu)化算法，第一次循環(huán)后如果時(shí)間如果時(shí)間復(fù)雜度為n(0) 直接返回

def bubble_sort(pop_list):
    count = 0
    for j in range(len(pop_list) - 1, 0, -1):

        for i in range(0, j):
            if pop_list[i] > pop_list[i + 1]:
                pop_list[i], pop_list[i + 1] = pop_list[i + 1], pop_list[i]
                count += 1
                print('進(jìn)入循環(huán)')
    if count == 0:
        return pop_list