【LeetCode】计数排序（python版）

计数排序原理：
计数排序算法不直接通过比较数字的大小来确定位置，它采用一个巧妙的方法，选择一个数为基数，然后统计整个数列中有多少个数比基数小，如果有n个数比基数小，呢么基数就放到新数列的第n+1的位置上。

import random
import timeit

def randomList(n):
    iList = []
    for i in range(n):
        iList.append(random.randrange(0,1000))
    return iList
 #冒泡排序
def bubblesort(iList):
    if (len(iList)<=1):
        return iList
    for i in range(1,len(iList)):
        for j in range(0,len(iList)-i):
            if(iList[j]>iList[j+1]):
                iList[j],iList[j+1] = iList[j+1],iList[j]
    return iList
#选择排序
def selectsort(iList):
    if(len(iList)<=1):
        return iList
    for i in range(0,len(iList)-1):
        if iList[i] != min(iList[i:]):
            minIndex = iList.index(min(iList[i:]))
            iList[i],iList[minIndex] = iList[minIndex],iList[i]
    return iList
#插入排序
def insetionsort(iList):
    if(len(iList)<=1):
        return iList
    for right in range(1,len(iList)):
        target = iList[right]
        for left in range(0,right):
            if target<=iList[left]:
                iList[left+1:right+1] = iList[left:right]
                iList[left] = target;
                break
    return iList
#快速排序
def quicksort(iList):
    if(len(iList)<=1):
        return iList
    left = []
    right = []
    for i in iList[1:]:
        if i<=iList[0]:
            left.append(i)
        else :
            right.append(i) 
    return quicksort(left)+[iList[0]]+quicksort(right)
#计数排序
def countingsort(iList):
    if(len(iList)<=1):
        return iList
    iLen = len(iList)
    rList = [None]*iLen
    for i in range(iLen):
        same = 0
        small = 0
        for j in range(iLen):
            if iList[j]<iList[i]:
                small +=1
            elif iList[j]==iList[i]:
                same +=1 
        for k in range(small,small+same):
            rList[k] = iList[i]
    return rList


if __name__ == "__main__":
    iList = randomList(20)
    print(iList)
    print(countingsort(iList))
    #print(timeit.timeit("selectsort(iList)","from _main_ import selectsort,iList",number=100))