全排列的递归算法实现  

The Realization of Recursive Algorithm for Full Permutation

作　　者：李盘荣[1] 

机构地区：[1]无锡市广播电视大学,江苏无锡214011

出　　处：《电脑编程技巧与维护》2011年第18期25-27,共3页Computer Programming Skills & Maintenance

摘　　要：递归算法的设计与实现是非常重要的内容,全排列是组合数学中最常见的问题。提出了基于递归算法并通过C语言编程实现了计算机解题,实例数据表明程序非常高效。The design and realization of recursive algorithm is very import ant. 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.

关 键 词：递归 全排列 全排列递归算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]