编程 工具栏的制作 可供初学者参考使用

c++编程的一些简单例子-some simple examples

与回溯算法求解0-1背包问题的界限，没有界限，对比搜索量，可以输出程序中的特定数据

Z值渲染，VB＋M0开发的GIS源代码，可以在二维图上增加Z值，实现第三维操作-Z value rendering, VB M0 developed GIS source code, can be increased in two-dimensional map of Z values, the realization of the third-dimensional operation

一个完全免费的条码打印控件-a free barcode printing controls

二维笛卡尔坐标系下网格的划分，包括多重网格等。-Two-dimensional Cartesian coordinate system, the division of the grid, including the multi-grid and so on

将tiff转换成PDF的源程序-Source code that can convert tiff format to pdf format

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

用JAVA 实现的简单的ATM-using JAVA simple ATM

测绘仪器的模拟器，具有相当大的实用性，对于业界人士很有帮助。-Surveying and mapping equipment simulators, with considerable practical, helpful for people in the industry.

一个用DirectX开发的简单而强大的游戏引擎-Using DirectX to develop a simple and powerful game engine