Backward recursive method used to achieve the eight

skip-list 一种数据结构 一种图的表示方法-A skip-list data structure of a graph representation

调试顺序结构栈的基本操作(清华大学出版社数据结构C语言版书本P44)-Debug stack order of the structure of the basic operations (Tsinghua University Press Data Structures C language version of the book P44)

数据结构霍夫曼编码译码程序-data structure Hoffman codecs procedures

输入稀疏矩阵中非零的元素，然后建立整个矩阵，实现这两个矩阵相加、相减和相乘运算。 -Enter non-zero elements of sparse matrix, and then build the whole matrix, to achieve these two matrices are added together, subtraction, and multiplication operations.

此应用程序可以帮助医生和记录的数据，什么应该药物消耗量，bios 医生检查

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

用perl写的Oracle管理工具- Oracle management tool writes which with perl

jsp+oracle的简单留言本，使用jdbc连接数据库-jsp+ oracle simple message of this, use jdbc to connect database

pao madengsd sdf sdfdfs dfsdf -pao madeng fghdfhgfdgfgfggffg

一种基于数据访问流的数据库索引优化方法该方法通过集成业务流程模型与数据模型，抽取了流程活动中包含的数据访问操作和流程的控制结构形成数据访问流，分析了数据访问流中数据访问操作的频度，为频繁数据访问操作所对应的数据项创建索引，达到改善数据访问性能的目的。实验结果表明，该方法提高了数据查询的速度。-A novel method called data-access-flow based index optimization (DAFIO) is proposed to provide automatic index select for databasein order to improve the data access performance. By integrating the data model and process model of the IT systems and getting data access flow, theDAFIO method can analyze the data access flow to find those data item which are accessed frequently, and then create indexes for these frequentitems. The experiment results show that the novel method is effective to improve the data access performance.