Delphi XML序列化库

数据结构课程设计内部排序的比较 一共有十种排序方法-Curriculum design of internal data structure to sort of comparison a total of 10 kinds of sorting methods

1、 字符串由随机产生的1~16位的字母组成，然后用插入排序、冒泡排序、堆排序、快速排序、归并排序对字符串进行排序。-1, the string randomly generated by the 1 ~ 16 of the letters, and then use Insertion Sort, Bubble Sort, Heap Sort, Quick sort, merge sort to sort on the string.

通过该程序实现huffman编码，解码。输入一段字符串，统计字符出现频率，输出huffman编码。输入一段编码，根据预先设定的解码方式进行解码。-Through the process to achieve huffman encoding and decoding. Enter a string, statistical character frequency, the output huffman coding. Enter a code, based on pre-set decoding method to decode.

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing

本文当为二叉树的演示程序，应用于学习研究-In this paper, as the binary tree demo program used in study

用链表来实现的一个学生成绩管理管理系统，操作简单，清晰明了。-With a list to achieve the management of student achievement management system that is simple, clear.

房产中介信息管理 房产中介信息管理-Real Estate Agents Real Estate Agents Information Management Information Management

一个组态王6.53的实例，小球走椭圆轨道，适合初学者参考。-An instance of KingView 6.53, the small ball go elliptical orbit, suitable for advanced users.

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.

将nginx的内存池管理源代码修改到vc上，附有演示程序