旋转法求排列

# -*- coding: UTF-8 -*- 
'''
旋转法求排列，比预想的简单，或许以前看过这个算法
'''
def ProductPermut(listYuan, numOfXuanZhuan):
	if numOfXuanZhuan == 1:
		print listYuan
		return

	for i in range(0, numOfXuanZhuan):
		ProductPermut(listYuan, numOfXuanZhuan -1 )

		temp=listYuan[numOfXuanZhuan-1]
		for j in range(numOfXuanZhuan-1, 0, -1):
			listYuan[j]=listYuan[j-1]
		listYuan[0]=temp
		


listYuan=[1,2,3,4]
ProductPermut(listYuan, len(listYuan))