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 SelectionSort(arr):
    n = len(arr)
    for i in range(n): 
        min_idx = i 
        for j in range(i+1, n): 
            if arr[min_idx] > arr[j]: 
                min_idx = j 
                
        arr[i], arr[min_idx] = arr[min_idx], arr[i] 


@jit
def SelectionSortjit(arr):
    n = len(arr)
    for i in range(n): 
        min_idx = i 
        for j in range(i+1, n): 
            if arr[min_idx] > arr[j]: 
                min_idx = j 
                
        if min_idx != i: 
            arr[i], arr[min_idx] = arr[min_idx], arr[i] 


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() 
SelectionSort(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() 
SelectionSortjit(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() 
SelectionSortjit(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==============================")