mathandos

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)

关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )

实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)