十字链表和求鞍点的程序

文件与IO存取,数据绑定,数据库更新,章立民的程序-Documents and IO access, data binding, database updates, rules and procedures for public

][String]有多种方法可以使整个字符串排列，（不重复）整个数组，还有字典方法

用C语言实现的算法题中的加油问题。 用贪心算法实现的。-C language algorithms that the refueling problem. With the greedy algorithm.

这是聊天系统的服务器端，它控制客户端程序的登录和连接，采用ACCE-This is a server-side chat system, which controls the client program to log in and connect, using ACCE

这是我的功课，与我的朋友。此示例数据库从 dvd 出租店。有 6 个实体，有一个关系 N N，N-1，执行查询，子查询，函数、 包，过程中，光标和触发器。

用数据结构做的约瑟夫问题，其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election

主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree get root node, the father node, all the ancestors, the left son, right son, insert the left son, right son, to find an element, and the former , during and after, hierarchical traversal and related operations. In addition, you can display tree tree information.

二叉数插入排序,及删除算法-two forks inserted several sequencing, and deletion algorithm

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

实现如何利用VB创建ACCESS 2000格式的数据库及数据库表,里面含有一个很好的表格近代件,支持背景图片显示!-realize how to use VB to create 2,000 ACCESS database format and database tables, which contains a very good form of modern pieces, support background images show!