UG二次开发，实现feature浏览，UG二次开发，实现feature浏览

删除计算机内一个非空的目录-delete computer to a non-empty directory

C++一级实践课上完成的实践作业,异质树的实现-a practical lesson on the practice of completion of operations, the realization of heterogeneity tree

usb监听源码,需要安装DDK环境中运行-usb monitor source

一个颜色互换的例子，显示了不同图形不同颜色随着时间而变化，入门好程序-a color swap example to show that the different color graphics change with the times, good entry procedures

　　游戏人的平台，提供游戏业内、市场、渠道、研发资讯，面向游戏制作者、经理人、游戏公司 …… GameRes将成为您最好的伙伴！-The game" s platform, the video game industry, market, channel, research and development information, for the game makers, managers, and game companies ... ... GameRes will become your best partner!

登录----选择-----客户端，服务器（可互发消息）

服务器聊天应用程序.-Chat server applications.

VB编程操作Win9X注册表的模块.-VB operation Win9X registry modules.

wince6.0下最简单的hello world程序-wince6.0 most simple hello world program

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat