| 全排列的递归算法实现 |
| |
| 引用本文： | 李盘荣. 全排列的递归算法实现[J]. 电脑编程技巧与维护, 2011, 0(18): 25-27 |
| |
| 作者姓名： | 李盘荣 |
| |
| 作者单位： | 无锡市广播电视大学,江苏无锡,214011 |
| |
| 摘 要： | 递归算法的设计与实现是非常重要的内容，全排列是组合数学中最常见的问题。提出了基于递归算法并通过c语言编程实现了计算机解题，实例数据表明程序非常高效。
|
| 关 键 词： | 递归 全排列 全排列递归算法 |
The Realization of Recursive Algorithm for Full Permutation |
| |
| LI Panrong. The Realization of Recursive Algorithm for Full Permutation[J]. Computer Programming Skills & Maintenance, 2011, 0(18): 25-27 |
| |
| Authors: | LI Panrong |
| |
| Affiliation: | LI Panrong (Wuxi Radio & TV University,Jiangsu Wuxi 214011) |
| |
| Abstract: | The design and realization of recursive algorithm is very important.Full Permutation is one of the familiar combinatorics questions.In this paper,the author introduced an algorithm which was based on recursive algorithm and was programmed by C language in order to work out the puzzle.The experiments show that this method has high efficiency. |
| |
| Keywords: | Recursive Full Permutation Full Permutation Recursive Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
