python实现基础排序算法之(冒泡排序)

冒泡排序算法的运作如下:

# -*- coding:utf-8 -*-
# __author__ = 'jakey'
# 该算法复杂度为n^2 两次遍历(可设置标志进行优化)

import time

def algorithm(args):
"""
冒泡排序
:return:
"""
if not args or not isinstance(args, list):
return []

for i in range(len(args)-1):
for j in range(1, len(args)-i):
if args[j-1] > args[j]:
args[j], args[j-1] = args[j-1], args[j]

return args

if __name__ == "__main__":
un_order = [93, 1, 2, 3, 12, 34, 2, 5, 7, 8, 11, 0, 79]
begin_time = time.clock()
result = algorithm(un_order)
end_time = time.clock()
print result
# [0, 1, 2, 2, 3, 5, 7, 8, 11, 12, 34, 79, 93]
print end_time - begin_time
# 1.4e-05

博客来源:  http://blog.csdn.net/juanjuel[/code]