VC下的ADO编程封装类。可灵活方便的应用于VC下的ADO编程

Data Structure of maps

此程序为一个简单的oracle数据库程序，用于学生信息与课程成绩对应-This procedure as a simple oracle database for student information and curriculum corresponding results

将图片数据全部放在了数据库中，利用OLE对象的存储方式-All the picture data on the database, the use of OLE object storage

这是我帮同学做的一个链表操作的演示程序，可以模拟链表的插入删除-This is what I do to help students operate a chain of demonstration program, it is possible to simulate the insertion deletion Chain

RMQ的st算法，两道题，一个是一维的，一个是二维的-RMQ the st algorithm, two questions, one is one-dimensional, and one is two-dimensional

MD5算法的java实现，完整的代码，供大家学习只用-java MD5 algorithm to achieve complete code for all to study only

按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage

以前做的课程设计,可用于学习VB与ACCESS的连接!-done before the curriculum design, learning VB can be used in connection with ACCESS!

用Matlab实现的Dijkstra算法源码。主要用于求最短路径。-Using Matlab source realize the Dijkstra algorithm. Mainly used for the shortest path.

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree