一个有趣的算法。。。十分有趣

此函数的功能是依次选出两个小的数，不要求原来数组中的数按大小顺序排列。-The function of this function are followed by two smaller number of elected and does not require a number of the original array by the size of order.

二叉树的VC++6.0的详细源代码实现，有测试的例子，测试通过，需要的可以下载。-Binary Tree VC++ 6.0 realize the detailed source code, there are examples of test, test passed, the needs can be downloaded.

Tutorial on data access using store procedure for MSSQL

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize

彪彪关游戏 a) 如何使用? 第一次单击任何记得，然后按钮后单击一个按钮，然后记住所有的任何按钮，您单击了。 增加了匹配按钮时发现那两个这些按钮中删除的时间和柜台。 当你无法识别匹

wpf 动态添加datagrid,通过代码在后台动态生成datagrid

插入运算符算法，123456789=a，在等式左边的任意两个数字之间插入 + - *使得等式成立，列出满足条件的所有结果-Insert operator algorithm, 123456789 = a, the left side of the equation inserted between any two figures+-* Make the equation set up, listing all of the results meet the conditions

VC++编写的通讯录实例，实现简单数据库功能 （不用后台数据库支持）-VC prepared directories example, to achieve a simple database function (no background database support)

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q