"""
1、冒泡排序
"""
def bubble_sort(item):
n = len(item)
for j in range(0,n-1):
for i in range(0,n-1-j):
if item[i+ 1] < item[i]:
item[i],item[i+1] = item[i+1],item[i]
if __name__ == "__main__":
list = [12,35,62,20,35,94,78,56,24,11,38]
print(list)
list_1 = bubble_sort(list)
print(list)
该算法的复杂度为O(n*2),当list刚开始就顺序排列的时候,我们只进行一次遍历就行了,所以可以将代码优化如下:
"""
1、冒泡排序
"""
def bubble_sort(item):
n = len(item)
# 标志位leap大小若没变则说明列表数据没有进行过翻转
leap =1
for j in range(0,n-1):
for i in range(0,n-1-j):
if item[i+ 1] < item[i]:
item[i],item[i+1] = item[i+1],item[i]
leap =0
if leap:
break
if __name__ == "__main__":
#list = [12,35,62,20,35,94,78,56,24,11,38]
list = [1,2,3,4]
print(list)
list_1 = bubble_sort(list)
print(list)
当list为顺序列表时,其时间复杂为n(1)。