数据结构 课件 东软内部资料！！ 给需要的人

插入排序的直接改进算法--希尔排序算法.将用户输入的一列数按递增顺序排好并输出.以及直接插入冒泡选择排序算法的实现-inserted directly improve the ranking algorithm-- Hill sorting algorithms. Users input a few in increasing order to arrange and output. Bubble and direct insertion Selection Sorting Algorithm Implementation

在本机票预定系统项目的前一阶段，也就是概要设计阶段中，已经将系统用户对本系统的子模块功能做了详细的阐述，这些模块功能具体设计将在本报告中详尽得以叙述及阐明。 本阶段已在系统的概要设计的基础上，对机票预定系统做详细设计。主要解决了实现该系统程序模块具体设计问题。包括确定算法，数据结构，模块接口的使用，数据库的动态操作以及界面设计等。在以下的概要设计报告中将对在本阶段中对系统所做的所有详细设计进行详细的说明。 -In the ticket reservation system project in the previous phase, which is a summary of the design phase, the system user has a subset of the system modules have done a detailed, specific design features of these modules will be detailed in this report can be described and explained . This phase of the outline design of system based on air ticket reservation system do the detailed design. The main solution to the achievement of specific program modules of the system design issues. Including the identification of algorithms, data structure, the use of module interfaces, databases, dynamic operation, as well as interface design. In the following report will outline the design at this stage of the system has done all the detailed design detail.

数据结构和算法：包含各种算法，还有一个演示系统-data structures and algorithms : algorithms contained, a demonstration system

女问题描述： 设R={r1,r2,...rn}要进行排列的n个元素。其巾元素r1,r2...rn可能相同。试设计 一个算法,列出R的所有不同排列。 编程任务： 给定n以及待排列的n个元素。计算出这n个元索的所有不同排列。-Female Problem Description: Let R = (r1, r2, ... rn) must be arranged in n elements. The towel elements r1, r2 ... rn may be the same. Try to design an algorithm listing all the different arrangement of R. Programming tasks: Given n and n elements to be arranged. To calculate the n-element array of all the different cable.

用pb做的职员管理-pb do with the management staff

应用背景这个网站已经发展到帮助其他程序员捕获屏幕在他们的应用程序，你可以将它捕获任何时候一些人想保存/更改数据库关键技术VB屏幕捕获机制，利用内置摄像头在你的机器。一般的应用程序使用v.b捕获屏幕

ISAM系统实现，含有BTREE源码，等-ISAM system containing BTREE source, such as

固定资产管理系统-Fixed Assets Management System

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table. -This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wr