插入排序算法-python实现

#-*- coding: UTF-8 -*-
import numpy as np

def InsertSort(a):
    for i in xrange(1,a.size):
        for j in xrange(i,0, -1):
            if a[j-1] > a[j]:
                a[j-1] , a[j] = a[j], a[j-1]
            else:
                break

if __name__ == '__main__':
    a = np.random.randint(0, 10, size = 10)
    print "Before sorting..."
    print "---------------------------------------------------------------"
    print a
    print "---------------------------------------------------------------"
    print "After sorting..."
    InsertSort(a)
    print "---------------------------------------------------------------"
    print a
    print "---------------------------------------------------------------"