Python实现冒泡排序、选择排序

冒泡排序

# def bubble_sort(alsit):
#     n = len(alsit)
#     for j in range(0,n-1):
#         for i in range(0,n-1-j):
#             if alsit[i] > alsit[i+1]:
#                 alsit[i],alsit[i+1] = alsit[i+1],alsit[i]
#
#
# if __name__=="__main__":
#     li = [234,345,11,24,5346,868,23]
#     print(li)
#     bubble_sort(li)
#     print(li)

#选择排序

# def select_sort(alsit):
#     n = len(alsit)
#     for j in range(n-1):
#         min_index = j
#         for i in range(j+1,n):
#             if alsit[min_index] > alsit[i]:
#                 min_index = i
#         alsit[min_index],alsit[j] = alsit[j],alsit[min_index]
#
# if __name__=="__main__":
#     li = [54,26,93,17,77,31,44,55,20]
#     print(li)
#     select_sort(li)
#     print(li)