数据结构与算法

数据结构 详细描述了如何创建单循坏链表的方法以及操作-Data structure described in detail how to create a single through the bad list of methods and operations

The crystallize of the initial study, one class examination system of calculator, everyone gives order to point out.-The crystallize of the initial study, one class examination system of calculator. everyone gives order to point out.

数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods

fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；

这是一个数据结构常用的算法叫huffman编码.是对一棵二叉树进行huffman编码的算法-This is a common data structure called Huffman coding algorithm. For a binary tree for Huffman coding algorithm

基本的冒泡算法，可供数据结构的初学者参考，希望能有所帮助。-sort

通过输入一串英文（权值）来构建赫夫曼树，并在当前目录下打印赫夫曼图像

一个octree algorithm 的实现CQuantizer.-The octree algorithm realize a CQuantizer.

//希尔排序void ShellSort(int r[], int n){ int i; int d; int j;    for (d=n/2; d>=1; d=d/2)            //以增量为d进行直接插入排序 {     for (i=d+1; i0 &am

对绘图工作者，绘图工作可能有一定的帮助。-right Mapping workers, drawings may be of some help.