build_max_heap

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

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)

该程序分析eit表的数据结构，病输出相应内容信息(parse eit table and output content info)

斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)

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

单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)