搜索资源列表
FullArray
- 全排列实现算法，性能非常好，能做出15个数字以内的全排列。-algorithm with the whole performance is very good, would make 15 figures within the entire order.
pailie
- 排列问题 M个1,N个0的排列(高效率版) 排列数为:c(m+n,n) 对n个0,m个1,我的想法是这样的: 每个排列可以分三段: 全0列,全1列, 子问题列 设各段长:r,s,t .子问题列就是 (n,m) = (n-r,m-s),其中0<=r<=n,s=1-problem with M-1, N 0 is the order (high-efficiency version) with a few : c (m n, n) of n 0, m one, I
判断套汇路径
- 利用全排列的算法编的判断套汇路径的算法-use with a whole series of algorithms to judge arbitrage path algorithm
permutation
- 产生全排列的程序-have with the whole process
quanpailie全排列
- 此程序完成全排列问题，大家可以讨论学习。-this with the whole procedure is completed, we can discuss learning.