c language using the six methods of sorting operations, thus comparing the chara...

关于数据库的-On the database

应用背景图论相关，图论相关算及其应用。邻接矩阵 的实现方法，。。图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法图论相关，图论相关算及其应用。邻接矩阵 的实现方法关键技术C++源码 源代码C++源码 源代码 邻接矩阵的具体实现方法，VS 2010编写 C++源码，据对可以运行，

SQLite的封装类，简单实用，支持常用操作！ 自己感觉封装的不错，运行平台有：windows、linux、unix。 如果有什么问题和建议，请邮件yin0123@sina.com

VC编写的读取数据文件的源码-VC compilation reads the fetching according to the document source code

本程序用来学校管理学生挡案用. 采用Access数据库,程序实现关键在应用ODBC 的两个类.-procedures for the management of schools with students archives. Access database, program lies in the application of two types of ODBC.

一个会议签到系统-a meeting attendance system

这个是我们大学的一个小学期作业，是完成关键路径的搜索-this is our university a primary period of operation is the completion of the Critical Path Search

想学习算法的朋友，可以看看拉格朗日算法参考参考-Want to learn algorithms Friend, you can look at the Lagrangian algorithm reference reference

哈夫曼树算法 根据给定的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

数据结构双链表的 例子-data structure-Chain example