湖南大学文献信息检索课综合实习报告 2． 进入湖大图书馆网站http://lib.hnu.cn/ 的“数字资源”各数据库（即文献库）查找课题相关文献信息资料...

这是一个生成组合序列的程序,而且是非递归的,代码非常精简,速度很快,序列是字典序的.-This is a combination of sequence generation process, but also non- recursive, code very concise, very fast, is the sequence of lexicographic.

unix上的ODBC实现-unix on ODBC to achieve

数据结构，c源代码。 -Data structures, c source code.

matlab论文，对于一些人可能有用的。第一次上传，不是很精通。-matlab papers may be useful for some people. The first upload is not very proficient. Hehe

VC++编写的通讯录实例，实现简单数据库功能 （不用后台数据库支持）-VC prepared directories example, to achieve a simple database function (no background database support)

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

Mysql数据库的web管理工具-Mysql database web management tool

使用VC++对Excel的数据读取，使用VC++6.0编写，含有《odbcinst.h》头文件编写,如果还有疑问请发邮件给我-use Excel to read the data, the use of VC 6.0, containing "odbcinst.h" The first document preparation, if still in doubt please send an email to

界面直观，功能齐全量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码-量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码

几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣.-several commonly used algorithm efficiency comparison, the test may come this algorithm several merits.