电影票预定系统

图的邻接矩阵存储结构 图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal

dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs-dhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbs

用VC实现数据结构中冒泡排序，快速排序，希尔排序等各种改进排序算法-Data structure with the VC bubble sort, quick sort, Shell sort and other sorting algorithm to improve

这是最好的考试系统，内容是太短。注意请： 代码没有很好的描述将被删除，你不会得到任何点。请描述更好地获得更多积分。

精密单点定位程序,需要下载精密星历与精密接手记钟差!-precision single-point positioning procedures need to download precise ephemeris and sophisticated access Notes bell worse!

一个简单的数据库管理工具，可以管理Oracle等- A simple data bank administration tool, may manage Oracle and so on

投票系统 FLASH版 用了都说好 数据库及使用说明都在里面了-falsh yingyun ji toupiao xiazai

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

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

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