用VC写的模拟内存分配管理的代码,经测试运行完全正确

最短路径算法源代码!用于mapx最短路径的算法!-Shortest path algorithm source code! For the shortest path algorithm MapX!

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

INFORMIX数据库优化SHELL，可以一目了然地发现数据库中的性能问题。-shell form informix ,can find question of databases

双向约瑟夫问题，利用双向链表实现双向进行的约瑟夫问题-Two-way Joseph problems, using two-way two-way linked to the issue of Joseph

Tianjin University Online Judge 的80多道题目 . -Tianjin University Online Judge

C语言编写的标准链表模板。包含链表的9种基本操作，链表的创建，判断，结点的增加、删除、查找，链表的删除等。-C language linked list of standard templates. Contains the list of nine kinds of basic operation, list creation, judgments node to add, delete, search, delete, etc. the list.

C++ Builder程序员学习数据结构 第1章源码-Builder C programmers to learn data structure source Chapter 1

十字链表和求鞍点的程序-Cross and saddle point for the procedure

数据库源码-source database.