测试蓝本，请留意，功能很全的，可以参照，减少工作量。

C++程序设计源代码例-C programming source code cases

实现两个四层电梯同时控制，有开门、关门、报警功能-To achieve simultaneous control of two four-story elevator, there are open, closed, alarm function

4. 建立一个有序的顺序表（10，30，35，50，56，100，120），用折半查找方法在此表中查找任一整数，若找到则输出此整数在表中的位置序号，否则输出Not found.-4. Establish an orderly sequence (10,30,35,50,56,100,120) using binary search method in this table as a whole you, if the output is found in this round table position serial number, Otherwise output Not found.

不同椭球坐标转化，54-84，统一椭球参数高斯正反算-Coordinate transformation ,54-84

一个基于LABVIEW的LCD的显示程序，是可以循环移动的，快来学习吧。-LABVIEW-based program the LCD display can cycle mobile, Come learn from it.

力麒排队系统服务端原代码-edge Yee Queuing System server source code

考勤专家》安装软件包括以下两个文件： 1、Tr520.exe 2、Tr520.w02 压缩包中文件kq.mdb是一个测试数据库文件，安装完成并且完成第一次运行后， 用该文件替换掉安装目录下的 TimeRecordermdbkq.mdb 文件即可。 系统安装后附有使用说明书和帮助文件。-appraisal experts "install the software include the following two documents : one, two Tr520.exe. Tr520.w02 compression package kq.mdb document is a test database files, completed the installation and completion of the first run, with the document replace installed in the directory TimeRecorder mdb kq.mdb document can be . System installation with the use of manual and help files.

这是一款能在液晶模块上显示数字的程序，显示六位数字。-This is a LCD module can display the number of procedures, showing a six-figure.

用vc++开发的贪吃蛇游戏，初学者还是很有用的。-vc with the development of the huge memory games, beginners or very useful.

平衡二叉树操作的演示 一、 需求分析 （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