图像分割中的一个很好的代码，来自于国外的网站，在国外的研究中对其进行了研究和分析…

系统的连表学习文件-system to study the documents even Table

利用SysInfo控制得到计算机的电池使用状况-use of computer battery usage

这对于功率流分析非常有用。此程序可用于验证用户程序是否给出正确的负荷流解决方案（使用Gauss-Siedel方法最多4个有效数字）。程序给出了中间解。用户应按以下指定格式提供数据和解决方案；

以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).

User instructions and event information are displayed during execution. Phones must be on hook before starting the sample.

Silverlight围棋在线对弈程序 Silverlight围棋在线对弈程序-a program

测试手写程序，一个很好的EVC小程序，希望大家能够交流学习-Handwriting test procedures, a very good small EVC procedures, hope that we can learn

一个进程通信的例子-an example of communication between processes

C编程例子38个,供基础学习用-38 for the foundation to study

用回溯法求解KnightTour问题 【KnightTour问题】在一个8×8的棋盘上，检验以某一位置作为出发点的棋子能否遍历一次棋盘上的所有棋格，且最后回到出发点。（备注：棋子每次只能沿东、南、西、北、东南、西南、东北、西北方向走一步！！)-Method with back issues KnightTour】 【KnightTour issues in a 8 × 8 chessboard, the examination for the position as the starting point of a piece of a chessboard can traverse all the chess grid, and the final return to the starting point. (Note: each piece can only be along the east, south, west, north, southeast, southwest, northeast, northwest direction step!!)