VB修改时间检测

内排序：插入、归并、基数、堆、快速排序vc6.0环境下通过编译-within Ordering : insert, merging, the base, sculpture, rapid sequencing vc6.0 environment through compiler

一个对数组越界检查的小程序-one pair of arrays of small cross-border inspection procedures

电子商务 物流 ASP+SQL2-ASP e-commerce logistics SQL2

此版本的华容道仅是个VC++语言的演示版，只是为了演示 一种思路，所以没有增加任何的功能。本游戏图象也是从 同类FLASH游戏中剪出，可惜它的出处网页已经不可访问了. 由于华容道每角色同一时刻可能有不同方向的选择，增加了 判断难度。本游戏主要演示单键无选择控制华容道的模拟 智能处理过程。当然这很简单，谈不上真正的智能。 如果对AI类兴趣的话，可以到 http://chess.withu.com 和计算机下一盘，欢迎交流探讨该类AI算法。 本游戏还存在一些BUG，就请各位自己修正了。 (是在边界处理上，少处理了一种特殊情况) 另：本游戏开放源码，可以随意使用或修改。 ------ musix@withu.com , 2001 , taizhou,jiangsu-HuaRong Road is only the VC language version of the demonstration, only to demonstrate an idea, no increase in functionality. The game image is similar FLASH from the game, cut out, but it"s not the source website has been visited. As HuaRong Road every role the same time may be different and the choice of direction, increasing the difficulty of judging. The main demonstration of a single-game non-selective control of HuaRong Road intelligent simulation process. Of course, this is very simple, no real intelligence. If the AI category of interest, to be the next http://chess.withu.com and computer disk welcome such exchange on

C# 实现多张GIF叠加的动画效果，一个会走路的小猫，实现原理是将多张GIF图片以一定速度串联显示，形成视觉上的连续动态效果，这也是最容易理解的一种动画形成方式。

利用Visual Basic编写的小程序，一款模拟贪吃蛇的小游戏。-The use of Visual Basic procedures for the preparation of a small, a simulation game of Snake.

vb试验代码段，内容为找指定数，适用于初学者使用-test vb code, content to find a few designated for beginners to use. . .

TCL2543电压表中的应用，能通讯的测量表，内存的分配-TCL2543 voltage meter application that can communicate measurement tables, memory allocation

主要是俄罗斯方块的源代码是用c语言编写的-Mainly Tetris source code is written in c

通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-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.