开括号和比括号的匹配，数据结构内容，很不错

多中通用排序算法组合源码，不好用你找我.-Sorting algorithm and more general source portfolio, not me with you.

应用背景此代码可用于制作与使用Java SQL数据库连接！你只需要替换数据库中的地址信息，用户名和通。关键技术此代码可用于建立数据库连接使用Java和SQL服务器中的应用。它不仅显示了如何连接到数据库，而且还可以如何进行查询和管理数据库连接。

一种查找数据库中关于一个字符串的匹配的数据结构-Find a database on a string of matching data structure

这个是数据结构中一定有的哈夫曼的实验-this is the data structure will have to Huffman experiments

随机产生5组测试数据，分别进行顺序查找，折半查找和分块查找，输出比较结果-five groups randomly generated test data, for the order to search, locate and half-block search, the output results

清华大学数据结构课上实现的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;

本代码已经在VC＋＋环境下编译实现，但不知道在纯C＋＋下运行结果会怎样-the code in Visual C++ compiler environment to achieve, but we do not know in pure C++ to run what will be the outcome

简单的计算器,暂时不支持复杂的函数如,三角函数等-A simple calculator, temporary does not support the complex functions such as trigonometric functions, etc.

本程序是在c调试成功的．对初学者有很大的作用！-the procedure was successful c debugging. For beginners a significant role!

主要是用在学校里记录学生考试成绩，方便学生和老师在网上对成绩进行查询