选择排序实现及优化--python

最近学习python写的点算法练手

基础班算法如下，因为pop算法比较耗时所以做了一些优化

def selecttion_sort(sortsortlist):
    for i in range(len(sortlist)-1):
        min_index = i
        for j in range(i+1,len(sortlist)):
            if(sortlist[j]<sortlist[min_index]):
                min_index = j
        sortlist.insert(i,sortlist.pop(min_index))       
sortlist =[1,34,23,5,122,6,71,19,2]
print sortlist
selecttion_sort(sortlist)
print sortlist

def selecttion_sort(sortsortlist):
    for i in range(len(sortlist)-1):
        min_index = i
        for j in range(i+1,len(sortlist)):
            if(sortlist[j]<sortlist[min_index]):
                min_index = j
        swap(sortsortlist,i,min_index)      
        
def swap(list,a,b):
    if(a != b):
        temp = list[a]
        list[a] = list[b]
        list[b] = temp       

sortlist =[1,34,23,5,122,6,71,19,2]
print sortlist
selecttion_sort(sortlist)
print sortlist