用全排列和递归求解“魔方”——C++程序设计

The Resolution of Magic Square by Means of Full Permutation and Recursion——C++ Programe Design

探讨了n阶矩阵n n个元素的全排列用C++程序语言的实现过程,解决了传统编程方法无法实现矩阵的所有元素的全排列的难题.实现过程充分利用了函数的递归调用,对矩阵在工程计算、经济数据分析(如列昂节夫投入—产出矩阵)等数据处理中的应用有一定的借鉴作用.

This article relates to the process of n-order matrix, the full permutation of n×n elements which is implemented by C++ program language, and resolves the problem of which traditional programming method can not implement the full permutation of all elements in that matrix. In the process of implementation, functional recursive calling utilized, which is quite useful for the digital handling in engineering calculation and economic data analysis(such as Rianjev input and output matrix), etc.