FreeTree

直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)

说明：  c编写的链表连接函数，上课时学的，上传试试 (c write the list to connect function, class, learn, try uploading)

迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(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. 双语对照 )

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

建立链表的算法： 新节点链入表尾建立链表： 动态分配第一个节点变量； 用指针head 妥善保存链表第一个节点的地址值； 依次动态分配一个新节点变量； 将上一个节点的指针域指向新生成的节点； 循环3),4)步骤，直到所有节点均连入链表； 将最后一个节点的指针域赋值为0； (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

里面有50例经典算法，其中包括水仙花素，兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)

本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)

先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)

说明：  由数字1和0组成迷宫，0代表可走路径，程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)