数独问题，利用函数递归调用产生每行每列都不同的所有5乘5矩阵，代码精炼，时间短-Sudoku problems, the use of recursive function calls generated for each row of each column is different for all 5 by 5 matrix, code refining, time is short

c++编写的汉诺塔解法，利用递归调用的算法-c++ written in Tower of Hanoi solution, using recursive calls of Algorithm

利用python语言，调用GUI模块，用递归函数编写汉诺塔问题的演示程序。-Use python language, invoke the GUI module, using a recursive function to write HANOR demonstration program.