包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的3个典型算法加演示。...

关于差分方程的一个程序，很简的二维椭圆方程，区域是1x1-differential equations on a procedure for the very simple two-dimensional elliptic equation, the region is 1x1

字符串扩展问题的递归算法及动态规划算法的详细分析及实现-implementation and detailed analysis of recursive algorithm and dynamic programming algorithm of string expansion issue

采有C++模板实现的一个数据结构"链表"，可以进行增加，删除，修改等20多个成员函数。 本程序适合初学数据结构的朋友们。

空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.

使用VC编写的约瑟夫环程序，简单明了，方便使用-Prepared using the VC Joseph Central program, simple and clear, easy to use

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

这是一个魅力 xml c + + 解析器，如果您需要 xpath，请下载我的其他来源 （快速 c + + xpath 语法分析器）.in 代码 xmltest，这测试解析器，向您展示如何使用解析器。

凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem

数据结构算法，china-pub的电子书，基于C-Data Structure Algorithm, china-pub of the e-book, based on the C++

二叉树的先序遍历，使用栈实现（构造空栈，初始化栈）-The first order binary tree traversal, use the stack to achieve (tectonic empty stack, initialize the stack)