defqsort(seq):

if seq==[]:

return []

defquicksort(list):

iflen(list)<2:

else:

pivot=seq[0]

lesser=qsort([xfor xin seq[1:]if x<pivot])

greater=qsort([xfor xin seq[1:]if x>=pivot])

return lesser+[pivot]+greater

if__name__=='__main__':

seq=[5,6,78,9,0,-1,2,3,-65,12]

print(qsort(seq))

midpivot= list[0]

lessbeforemidpivot= [ifor iin list[1:]if i<=midpivot]

biggerafterpivot= [ifor iin list[1:]if i> midpivot]

finallylist= quicksort(lessbeforemidpivot)+[midpivot]+quicksort(biggerafterpivot)

return finallylist

print quicksort([2,4,6,7,1,2,5])

递归基本思想:http://blog.csdn.net/morewindows/article/details/6684558

defcoinChange(values,money,coinsUsed):

for centsinrange(1, money+1):

minCoins= cents#从第一个开始到money的所有情况初始

for valuein values:

if value<= cents:

temp= coinsUsed[cents- value]+1

if temp< minCoins:

defcoinChange(values,valuesCounts,money,coinsUsed):

for centsinrange(1,money+1):

minCoins= cents

for kindinrange(0,valuesCounts):

if (values[kind]<= cents):

temp= coinsUsed[cents- values[kind]]+1

if (temp< minCoins):

minCoins= temp

coinsUsed[cents]= minCoins

print('面值为：{0} 的最小硬币数目为：{1}'.format(cents, coinsUsed[cents]))

print ('面值:{0}的最少硬币使用数为:{1}'.format(cents, coinsUsed[cents]))

if__name__=='__main__':

values= [25,21,10,5,1]

money=63

coinsUsed= {i:0for iinrange(money+1)}

coinChange(values, money, coinsUsed)

思路:http://blog.csdn.net/wdxin1322/article/details/9501163

方法:http://www.cnblogs.com/ChenxofHit/archive/2011/03/18/1988431.html

给定一个数组，构建二叉树，并且按层次打印这个二叉树