complete source code for game quake 1 by id software, a must have for game progr...

一种有效的哈希算法。。一种有效的哈希算法-a kind of effective hashing algorithm

c语言开发的五子棋游戏，简单的人工智能计算每步的分数，然后下子。-c language development of the welcome to play, simple artificial intelligence scores in each of the steps, and then erupted in.

c语言的PID控制算法程序，作为工业控制中的一种常用控制算法PID运算。-c language PID control algorithm procedures for industrial control of a PID control algorithm commonly used operations.

OPNET仿真实验，做了很久才积累下来的-OPNET

关于进程&线程查看器　用过vc++自带的Process Viewer，觉得这个小程序简单易用，有时候作用还很大，我就产生了自己做一个类似程序的想法，想着想着就着手作了起来。　 首先我查看了有关进程和线程的api函数（在tlhelp32.h中）了解了他们的用法。 　 具体实施阶段: 　　　界面设计：该实用程序的界面几乎完全参考vc++自带的Process Viewer，以前从未接触-threads on the process used vc viewer"s own Process Viewer and think that this small program is easy to use, has great role Sometimes, I have done a similar proceedings to the idea of embarking on pondered made up. First I look at the relevant processes and threads api function (in tlhelp32.h) understanding of their usage. Specific implementation phase : interface design : The utility interface reference vc almost entirely onboard Process Viewer, never contacts

the document is so good thatyou can ues it anywhere

m序列的生成器，rake接受，简单易用，希望对大家有帮助-m sequence generator, rake acceptable, easy to use, everybody would like to have help. . .

用vc6.0实现计算机器功能,通过该例可以了解简单对话框程序的编写-Vc6.0 realize with computer functionality, through which patients can learn simple procedures for the preparation of the dialog box

浙江大学ACM竞赛算法与数据结构内部培训资料，推荐-Zhejiang University ACM algorithm and data structure internal training materials, recommended

通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.