用内嵌法求多项式

使用数据解构编写的公交换乘系统！可以按路线查询！使用数据解构编写的公交换乘系统！可以按路线查询！

数据结构学习中遇到的二叉树的代码，运行快速-Study data structure encountered in the code tree, run fast

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.

      极大限制了服务器应用程序的使用，本程序采用ICPQ，利用端口实现的聊天室系统，可实现多个用户同时在线聊天，源代码包含了一份官方的文档，并加有注释。

数据字典的说明,对数据库设计有极大的帮助-Data dictionary description of the database design a great help to

定义并实现带头结点的循环双向链表类，除构造和析构函数外，成员函数还有取数据元素个数、插入、删除、取数据元素-definition and take the lead in achieving the cycle node type two-way linked list, in addition to the structural and destructor function, members also function from the number of data elements, insert, delete, extract the data elements

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

ADO 数据库编程　用ACCESS 数据库系统-ADO Database Programming using ACCESS database system

获得存储过程的数据集，TSQL 使用技巧, 获取存储过程的数据集,在SQL中进行保存,为下一段SQL使用作准备,  获得存储过程的数据集,规程非代码, 纯SQL SQL操作

用链表求300的阶乘,并且返回链表节点的个数.-used for the factorial 300, and returned to the linked list node number.