搜索资源列表
quan-pai-lie
- 一种基于递归的全排列算法，可以输出指定字符的所有排列组合-Full array based on recursive algorithm, you can specify the output of all the permutations and combinations of characters
CompleteArrange
- 将1~n进行全排列并输出各种排列的组合。-1 ~ n for the full array and output to the arrangement of the combination.
code-of-Permutation-
- 递增进制，递减进制，字典序，回溯法全排列的C++语言代码-code of Permutation
permutations
- 各种经典的全排列算法，包括逆字典法、N进制法、新邻位对换法、递归法以及回溯法等-All kinds of permutation algorithms.
exp1_quanpailie
- 输入2-20个整数，利用递归输出2-20个整数的全排列-Output 2-20 full array of integers
exp2_sort
- 输入2-20个整数，输出这2-20个整数的全排列-Enter an integer 2 to 20, the output of the full array of integers that 2-20
fulpartition
- 用递归的方法，对一个给定的数组，输出它的全排列-For a given array, output its full sort of array