Joseph

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)

COM中使用SAFEARRAY数组例程，代码中给了两种数组的用法，一种是字符串数组，另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)

使用全排列实现hash，看看吧相信对大家会有些帮助的(Full array hash)

数据结构与算法分析的 C++检索代码，很经典(the code of Data structure)

东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)

用不多于四种颜色为地图染色，使相邻的行政区不重色，是计算机科学中著名的“四染色”的典型应用，应用这个思想，是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)

建立链表的算法： 新节点链入表尾建立链表： 动态分配第一个节点变量； 用指针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 )

说明：  由C程序实现的 数学上 滑雪问题 的代码实现，供大家学习用(Ski problem code for all to learn to use)

多项式相加的数据结构试验·············(Polynomial sum test data structure)