使用VB和Dx编写的3D赛车游戏，类似跑跑卡丁车，暂时没有实现联网功能，有声音，有好几辆车，大量X模型，适合Dx进阶编程...

字符串的强悍操作，值得学习-string of tough operation, it is worth learning

管理系统小十分 而就身体后 是上 按时上突然后 -management system is very small and it is on the body after time after suddenly

MFC入门小程序源代码-MFC source code

Chat Client using TCP Socket in C#.NET

在UNIX 下的C 原代码.查UNIX 下的系统时间。并取得时间的函数.-under UNIX C source code. Investigation under the UNIX system time. And achieved a function of time.

漂亮的VB版本的界面,界面可以进行扩展并且所需要的代码又非常的少。是一个优秀的原码你可以下载学习之用。-pretty VB version of the interface, which can be expanded and needed code is very limited. Is an outstanding original code you can download learning.

河北工业大大一至大二学期，课程设计源码，课程题目是变幻线，希望对大家有所帮助，特别是河北工业大学的同学。-Hebei Tai substantially a second semester, the curriculum design source, the curriculum is changing the subject line, and they hope to help everyone, especially students of Hebei Industrial University.

电力系统故障计算，可以计算单相短路，单相接地短路，三相短路，两相短路接地，两相短路-power system fault, can calculate the single-phase short circuit, short-circuit to the single-phase and three-phase short-circuit, two-phase short-circuit grounding, two phase short circuit

MATLAB 7基础与提高书的配套源程序-MATLAB 7 basis and to improve the matching source book

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins