python実装挿入アルゴリズム

前回は挿入アルゴリズムについて簡単に説明しました
今日はpythonで実現します

#!/usr/bin/python
# -*- coding: utf-8 -*-
#    
def _insert_sort(the_list):
    the_list_len = len(the_list)
    if the_list_len == 0:
        print "    ，    "
        return
    else:
        for i in range(the_list_len):
            tmp = a[i]
            print  str(tmp)+"        "
            l=range(0,i)[::-1]
            for m in l:
                if a[m]>tmp :
                    a[m+1] = a[m]
                    a[m] = tmp
                    m = m-1
                    # print a
                    continue
            print "     " + str(a)
        print "     "+str(a)

# a = [31,41,59,26,41,1]
a = [10,9,7,5,6,3]
_insert_sort(a)

出力結果は以下の通りです.

10        
     [10, 9, 7, 5, 6, 3]
9        
     [9, 10, 7, 5, 6, 3]
7        
     [7, 9, 10, 5, 6, 3]
5        
     [5, 7, 9, 10, 6, 3]
6        
     [5, 6, 7, 9, 10, 3]
3        
     [3, 5, 6, 7, 9, 10]
     [3, 5, 6, 7, 9, 10]

コミュニケーションを歓迎する