使用VB创建ACCESS数据库

2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.

哈夫曼编码译码的程序，详细大家能用的上。程序里面有注释-Huffman encoding decoding procedures, we can use the details on. There are procedures Notes

ASP开发的非常简洁的在线报名系统。这个代码在网上很流行，不过本人没有测试过，可能存在一些小问题，行家应该一看就明白。-ASP developed a very simple online application system. This code has become very popular online, but I have not tested, there may be some small problem, one expert should be able to understand the look.

本软件实现对数据进行高级加密,值得一看,不可错过.-the right software for advanced data encryption, an eye-catcher, not to be missed.

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

直接附加数据库！ 修改 Include/ Class_Main.asp 为自己信息 后台admin admin 绍兴人才网程序-Direct-attached database! Modify Include/Class_Main.asp background information for their own talent network admin admin procedures Shaoxing

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

数据结构常用算法：图的最小生成树 经典算法：图的最小生成树-algorithm commonly used data structures : Figure the minimum spanning tree algorithm classic : Figure the minimum spanning tree

求图的任两结点间的距离，(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

二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in