冒泡排序
本文介绍了一种简单的排序算法——冒泡排序，并提供了详细的Python实现代码。该算法通过重复遍历要排序的数列，依次比较相邻元素并交换位置来达到排序的目的。
#!/usr/bin/python
#coding=utf-8
'''
冒泡排序算法
'''
def sort(array):
i = 0
len_array = len(array)
while i < len_array:
j=i+1
while j < len_array:
if array[j] > array[i]:
tmp = array[j]
array[j] = array[i]
array[i] = tmp
j = j+1
i = i+1
if __name__ == '__main__':
array = [2,3,2,45,56,234,132,13,54,0,-1,3]
sort(array)
for ii in array:
print ii,"---",
#coding=utf-8
'''
冒泡排序算法
'''
def sort(array):
i = 0
len_array = len(array)
while i < len_array:
j=i+1
while j < len_array:
if array[j] > array[i]:
tmp = array[j]
array[j] = array[i]
array[i] = tmp
j = j+1
i = i+1
if __name__ == '__main__':
array = [2,3,2,45,56,234,132,13,54,0,-1,3]
sort(array)
for ii in array:
print ii,"---",
扫一扫
7563
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
