ahuangCD

实现汉诺塔的操作步骤输出，可以设置1，2，3三个塔柱，输出结果为用1，2，3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)

一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

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

线性表的链接实现可利用单链表来实现，每个节点存储一个元素。 利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

输入迷宫行列数，1代表墙0代表路，之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)

自己用c语言写的一个模块化多电平最近电平调制排序的c程序，希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)

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

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)