Delphi中实现把数据集中的数据导出为word

重大环境危险源管理仅供参考-major source of environmental risk management is for reference only

哈夫曼树的基本运算与实现的基本算法，对于数据结构初学者很有用 -Huffman tree basic operations and realization of the basic algorithm, for data structures useful for beginners

常用算法的C语言描述。里边算法非常详尽。解压即可使用。-common algorithms described in C language. Inside algorithm very detailed. Decompression can be used.

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s

是一个在学习数据结构时编写的图结构，主要是用两种方法生成需要的图结构，其中有一个头文件都注释了，要是要使用的话，只需要将另一个头文件注释并把这个取消注释，在main方法中改一个类名就好了-Is a data structure in the learning plan to prepare the structure, is mainly used two methods to generate the need for the graph structure, in which there is a header file are annotated, if you want to use words, just another header file to the Notes and the cancellation of Notes, in the main method to a class name like the

这份是数据结构的一些资料，里面内容相对比较简单，但却非常值得一看～-This is some of the information data structure, which content is relatively simple, but very much worth a visit ~

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

unix上的TDS协议实现，实现了sybase/mssql的dblib,ctlib和ODBC-unix on the TDS protocol to achieve sybase/mssql of dblib, ctlib, and ODBC

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

C语言实现的寻找多数元素代码，含英文注释。算法采用《算法设计技巧与分析》（沙特）一书上的方法。在一个整数序列A中，如果整数r在A中出现的次数大于序列A的一半，那么我们把这个r称为多数元素。如何更快的找出这个元素呢？在原序列中去除两个不同的元素后，那么在原序列中的多数元素在新序列中还是多数元素。