快速排序 

 1 def quickSort(L, low, high):
 2     i = low 
 3     j = high
 4     if i >= j:
 5         return L
 6     key = L[i]
 7     while i < j:
 8         while i < j and L[j] >= key:
 9             j = j-1                                                             
10         L[i] = L[j]
11         while i < j and L[i] <= key:    
12             i = i+1 
13         L[j] = L[i]
14     L[i] = key 
15     quickSort(L, low, i-1)
16     quickSort(L, j+1, high)
17     return L
18 
19 li = [12,5,9,24,6,45,19,25]
20 newli = quickSort(li,0,len(li))
21 print newli

 

posted @ 2016-04-15 09:37  lovemx  阅读(102)  评论(0)    收藏  举报