MFC实现的图书馆管理系统，希望对大家有用。

这是最好的考试系统，内容是太短。注意请： 代码没有很好的描述将被删除，你不会得到任何点。请描述更好地获得更多积分。

数据结构(C++描述)电子教案,幻灯片-data structure (C) is the electronic lesson plans, slides

vc ADO 连接数据库-vc ADO to connect to the database

源树b，b树结构，删除，插入，相当于搜索，搜索功能的范围

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

pgc 解调算法的c 语言实现，有详细的说明和注释。-PGC demodulation algorithm c language, has detailed instructions and notes.

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.

一个数据结构，其中每个元素包含指向下一个和以前的内容在列表中，形成了双向线性名单。-A data structure in which each element contains pointers to the next and previous elements in the list, thus forming a bidirectional linear list.

用vb6.0实现GIS的重要算法TIN的生长算法。-GIS using vb6.0 an important method to achieve the growth of TIN algorithms.

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword