搜索资源列表
QuanPaiLie
- 给出一组数的全排列 如1,2,3给出 123,321,312-is a group of the whole arrangement is 123,321,312 as 1,2,3
QuanPaiLie
- 求几个元素全排列的情况，本程序是三个元素，运行后将全排列的结果显示出来
quanpailie
- 递归算法 功能能够实现对一个集合的所有排列进行输出-Recursive algorithm of a function can be achieved with a collection for all the output
quanpailie
- 本程序主要是实现数组的全排列，当用户输入一个数字串时，程序将打印出该数字串的所有组合-This program is mainly to achieve an array of full array, when a user enter a number string, the program will print out the number of strings of all the combinations
quanpailie
- 这是我用插入法编的，绝对高效。没事可以试试，非常好用。-This is my code with the Insert method, the absolute efficiency. Nothing can try, very easy to use.
quanpailie
- 依次输入exchange swap tianchongJ即可，若想修改全排列矩阵的大小，可在MATLAB中打开tianchongJ修改J和N。 -Enter exchange swap tianchongJ in turn can, If you want to modify the full array matrix size can be modified in MATLAB to open tianchongJ J and N.
quanpailie
- 通过字典排序法生成全排列 并对其进行检验，对全向置换进行计数-Sorting through the dictionary and its full array generated test on all counts to the replacement
quanpailie
- 递归求全排列。此程序完成了用递归求全排列。-Recursive perfectionist order. This process is complete array using recursive demand perfection.
quanpailie
- c++全排列算法，输入一组数显示其所有可能顺序的序列-Full alignment algorithm
quanpailie
- 利用C++实现的全排列生成算法~~实现数据全排列~-Permutations C++ implementation ~ ~ full array of the data ~
quanpailie
- 给定一串字符，列举出所有可能存在的排列方法。-Given a string of characters, the method may include all permutations exist.