pao madengsd sdf sdfdfs dfsdf

物流管理系统是一个典型的数据库应用程序，整个系统包括公司基本信息、部门基本信息、员工基本信息、客户基本信息、司机基本信息、车辆基本信息、货物申请信息、货物托运管理、客户验收情况、权限管理等模块。-Logistics Management System is a typical database application, the entire system, including basic information about the company, department of basic information, basic information about employees, customers basic information, basic information about the driver, vehicle basic information, application information goods, goods consignment management, customer acceptance, the Rights Management modules.

数据仓库建模技术详解-data warehouse technology Elaborates on Modeling

求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods

红黑树实现, 红黑树实现,红黑树实现-Red and black tree realize, realize black tree, a red, black tree realize

这是一个文档管理系统，有delphi开发的，有很多功能！是我的课程设计！-This is a document management system, developed by Delphi, has a lot of functions. I was the curriculum design!

Magio牛的usaco源代码，希望和大家共同学习-Magio cattle usaco source code, hope and common learning

数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

用来求取大的整数-used to strike large integer

数据结构课程的作业，代码通俗易懂，且运行效率高。-Data structure course work, the code easy to understand, and operating efficiency.