Python版的迷你程序——插入排序（用python写快速排序）

前几天学习了下几个排序算法，用C语言写了写。

C版的迷你程序——排序算法

这个是python版本的，使用了python的列表和模块numpy的数组格式，除了自己按照插入思想写的排序外，还对比了列表自身的sort方法和numba模块的加速耗时。

#!/usr/bin/env python3
# -*- coding: UTF-8 -*-
#

import numpy
import time
import copy
import math
import random
from numba import jit
from datetime import datetime 

def TimeTest():
    time.sleep(2)

def InsertionSort(arr):
    n = len(arr)
    for i in range(1, n): 
        key = arr[i] 
        j = i-1
        while j >=0 and key < arr[j] : 
            arr[j+1] = arr[j] 
            j -= 1
        arr[j+1] = key 


@jit
def InsertionSortjit(arr):
    n = len(arr)
    for i in range(1, n): 
        key = arr[i] 
        j = i-1
        while j >=0 and key < arr[j] : 
            arr[j+1] = arr[j] 
            j -= 1
        arr[j+1] = key 


start_ = datetime.utcnow()  
TimeTest()
end_ = datetime.utcnow()  
cdelt = (end_ - start_)  
print("\t\t\t\t\t\t\t\t TimeTesto running time: %.3fms" % (cdelt.microseconds))


arrlist=[]
arrlen=16*1024
for i in range(arrlen):
    arrlist.append(random.randint(0,32768))

arrlistjt = copy.deepcopy(arrlist)
arrlistso = copy.deepcopy(arrlist)


print ("排序self前的数组:")
for i in range(88):
    print ('%0.6d ' % arrlist[i], end=" ")

start_ = datetime.utcnow() 
InsertionSort(arrlist)
end_ = datetime.utcnow()  
cdelt = (end_ - start_)  
print("\n排序self耗时: ====== ====== ====== ====== ====== ====== ====== == %.3fms" % (cdelt.microseconds))

print ("排序self后的数组:")
for i in range(88):
    print ('%d ' % arrlist[i], end=" ")

########################################################################

print ("\n排序sort前的数组:")
for i in range(88):
    print ('%d ' % arrlistso[i], end=" ")

start_ = datetime.utcnow() 
arrlistso.sort(key=None, reverse=False)
end_ = datetime.utcnow()  
cdelt = (end_ - start_)  
print("\n排序sort耗时: ====== ====== ====== ====== ====== ====== ====== == %.3fms" % (cdelt.microseconds))

print ("排序sort后的数组:")
for i in range(88):
    print ('%d ' % arrlistso[i], end=" ")

########################################################################

nparrlistjt=numpy.array(arrlistjt)
print ("\n排序npselfjitnp前的数组:")
for i in range(88):
    print ('%d ' % nparrlistjt[i], end=" ")

start_ = datetime.utcnow() 
InsertionSortjit(nparrlistjt)
end_ = datetime.utcnow()  
cdelt = (end_ - start_)  
print("\n排序npselfjitnp耗时: ====== ====== ====== ====== ====== ====== == %.3fms" % (cdelt.microseconds))

print ("排序npselfjitnp后的数组:")
for i in range(88):
    print ('%d ' % nparrlistjt[i], end=" ")

########################################################################

print ("\n排序selfjit前的数组:")
for i in range(88):
    print ('%d ' % arrlistjt[i], end=" ")

start_ = datetime.utcnow() 
InsertionSortjit(arrlistjt)
end_ = datetime.utcnow()  
cdelt = (end_ - start_)  
print("\n排序selfjit耗时: ====== ====== ====== ====== ====== ====== ====== %.3fms" % (cdelt.microseconds))

print ("排序selfjit后的数组:")
for i in range(88):
    print ('%d ' % arrlistjt[i], end=" ")
print ("\n==============================")