a building, display and complete binary tree judgment of small procedures.

用VC写的模拟内存分配管理的代码,经测试运行完全正确-VC write memory allocation management simulation code, the test run entirely correct

包括快速排序、堆排序、合并排序等经典算法，有详细的说明，供初学者学习

数据结构课程设计报告,算术表达式求值,自动辨别算符优先级,括号,将char型转换成int计算,再将结果显示,具有精美用户界面-data structure curriculum design, arithmetic expression evaluates automatically identify operator precedence, in brackets, char to int conversion type, the result shows that the user interface is attractive

这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)

ch_lettres est une 统一德尔福倒拉转换 des chiffres en 纯文学法文

linearlist线性表的源代码数据结构需要的-Linear List linearlist source code data structure needed

算法：华容道问题的启发式搜索。寻求一种最优解的快速算法。-Algorithm: Huarong issues heuristic search.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

利用c++写的双向链表操作，有头插入，尾插入，中间寻找“朋友“的方式插入，适合简单数据结构分析

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern