Written with Delphi Gobang procedures, the need for winskindata controls,

这是用c#开发的，创建数据库，连接数据库的源代码，已经通过测试-This is a c# Development, create databases, connect to database source code has passed the test

一个简单的学生算术练习的程序,适合刚刚学习编程的同学-a simple arithmetic students practice procedures, just learning program for students

实现判卷和扩展编辑框以及使用动态控件功能-Achieve graders and expanded edit box and the use of dynamic control function

AI game ... Addison Wesley - Gamma, Helm, Johnson, Vlissides - Design Patterns, Elements of Reusable Object Oriented Software, 1998.pdf-AI game ......Addison Wesley- Gamma, Helm, Johnson, Vlissides- Design Patterns, Elements of Reusable Object Oriented Software, 1998.pdf

采用最新的canny算子实现了边界拟合程序给定图形后可以直接使用-use of the latest canny operator realization of the border fitting procedures to be determined after the graphics used directly

大名鼎鼎的SM501 2D显卡驱动， 系列源码文件，包括各种流行的处理器平台。 XScale SH4 AU1500 X86 从 WinCE 4.2-6.0 还有WindowsXP Embedded X86的。-Famous SM501 2D graphics-driven, family-source documents, including a variety of popular processor platforms. XScale SH4 AU1500 X86 from WinCE 4.2-6.0 there is a WindowsXP Embedded X86.

・此代码示范了如何利用 CreateToolhelp32Snapshot API函数枚举系统当前进程。以及如何用HANDLE OpenProcess(...)，TerminateProcess(...)来打开和关闭活动进程。... -this code demonstrated how to use CreateToolhelp32Snapshot API function except to the current process system. And how HANDLE OpenProcess (...), TerminateProcess (...) to open up the process and the closure of activities. ...

自动转换显示货币格式 Visual basic开发的小程序，功能很简单-automatic format conversion monetary Visual basic procedures for the development of small, very simple function

介绍认知网络的定义与内容，结合具体实例容易理解。适合学生和教师使用。-Introduce the definition of cognitive networks and content, combined with concrete examples easier to understand. The use of suitable students and teachers.

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