题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行...

能够运行的c调用sqlite的程序1，适合学习sqlite-Be able to run sqlite in c call one of the procedures for learning sqlite

数据结构作业题，堆栈和队的使用（大写字母表示魔王语言的词汇；小写字母表示人的词汇语言；魔王语言中包含括号）-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)

floyd，求最短路径的算法。。求任意两点间的最短距离-floyd, seeking the shortest path algorithms. . Arbitrary order of the shortest distance between two points

实现最短路径算法。 实现最短路径算法。-Realize the shortest path algorithm. Realize the shortest path algorithm.

oracle数据库管理员指南知道学习数据库 -oracle database administrators know the study guide to the database

数据统计后生成图表，适用于报表等，简单实用！-data generated graphics, applicable to such statements, simple and practical!

8 queens problem in c/c++

包含了数据结构课后大多数习题的解答，用于互相的交流与帮助 -contains data structures OSCAR most of the questions to answer, for the exchanges and mutual help

统计学生成绩表中各分数段学生人数，用列表框返回结果。-Statistics of student achievement scores above table the number of students, using the list box to return results.

数 据 结 构 大型 作业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