HANOI 塔问题求解.cpp，HANOI 塔问题是数据结构中具有典型的代表性问题...

关于这段代码我没有呼唤你在学生信息系统写使用 MS 访问我还精通 MS Access 数据库的发展，但我我还在学习。此应用程序的密码是： iveymae。该系统还将生成为学校学生的出勤报告。

含并、交和差运算的集合类型试验报告，这个报告是做计算机试验的标准样式，分为了7个模块。-containing, intersection and poor computing pool type test report, the report is made to the standard computer test pattern, divided into seven modules.

二叉树排序代码，动态生成二叉树，进行动态查找-Binary tree sort code, dynamically generated binary tree, dynamic search

数据结构作业图的一些集合 上面有优先遍历 和用链表和堆栈来实现的算法-data structure of some operations plan sets priority traverse above and the use of linked lists and to achieve the stack algorithm

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

这是一个基于OPENCV,寻找运动目标轮廓，以实现视频流的运动目标检测为目的Delphi例子。 并带有Delphi与OpenCv的编程接口。-This is based on OPENCV, search for moving object silhouette in order to achieve video streaming of moving target detection for the purpose of Delphi examples. OpenCv with Delphi and the programming interface.

代码名称：资料管理系统 一个资料管理系统的源程序，VB+ACCESS2000+ADO，功能强大-code name : an information management system information management system of the source, VB ACCESS2000 ADO, powerful

教务辅助管理系统利用VB开发的数据库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!-Senate Assistant Management System Using VB development of the database management system, which, students, teachers, Senate, the areas of the school to meet the needs of the academic management of the simple demand!

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

基于SDL的关于二叉树计算的源代码，是TXT的一些程序-SDL-based binary tree calculated on the source code, are some of the procedures TXT