Symbol Matching Program

实现文本格式文件中的括号匹配. 匹配算法采用堆栈来实现. 文件读取异常还需完善的人性化一些-Text format documents matching brackets. Matching algorithm uses the stack to achieve. Paper anomaly needs to be well-read human nature of some `` ``

李春葆的《数据结构教程》教学PPT及书中所有源码，很值得一看！-Li Chun-bao s Data Structure Course Teaching PPT and source book of all, it is worth a visit!

完成界面功能，与数据库连接，完成查询 插入 删除 登陆等功能-Completion of the interface functions, and database connection, complete the inquiry landing insert delete function

数据库基础知识的笔记题集,对初学者进行复习很有用-database

基于c++的各种算法，能是你在较短时间内掌握编程的精髓-Computing+for+Numerical+Methods+Using+Visual+C++

strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)

字符串形式的表达式求值算法，支持4则运算和括号-The string forms of expression evaluation algorithm, to support the four operations and brackets

PHP+MYSQL 实现网上订购火车票（可按车次车型座位类型区别），查询火车票信息，管理成员，管理订单等基本功能

算法函数实例，算法1，存放了书中所有的算法函数程序以及例子中的主函数程序-arithmetic functions example, an algorithm, the book store all the arithmetic functions procedures and examples of procedures for the main function

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.