冒泡排序算法-Python实现 

 1 #-*- coding: UTF-8 -*-
 2 import numpy as np
 3 def BubbleSort(a):
 4     for i in xrange(0, a.size):
 5         for j in xrange(i,a.size):
 6             if a[j] < a[i]:
 7                 a[i], a[j] = a[j], a[i]
 8 
 9 if __name__ == '__main__':
10     a = np.random.randint(0, 10, size = 10)
11     print "Before sorting..."
12     print "---------------------------------------------------------------"
13     print a
14     print "---------------------------------------------------------------"
15     BubbleSort(a)
16     print "After sorting..."
17     print "---------------------------------------------------------------"
18     print a
19     print "---------------------------------------------------------------"

 

posted on 2015-09-23 11:14  Alex Yu  阅读(417)  评论(0)  编辑  收藏  举报

导航