access2002数据库管理实务 超星格式图书

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

顺序表,第一次上传,多多照顾~~顺序表,第一次上传,多多照顾-chronology, the first upload, give more care ~ ~ chronology, the first upload, give more care

以一个Maze(m, n)的长方阵表示迷宫, 迷宫的入口是Maze(1,1), 出口是Maze(m, n), Maze(i,j)等于0表示通路, Maze(i,j)等于1表示障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。各个命令以及相关数据的输入格式如下： 输入迷宫：C，接下来一行是m n，其中m是迷宫矩阵行数，n是迷宫矩阵列数，接下来的m行数据是迷宫矩阵，每行n个值，表示一个m*n的迷宫矩阵 求迷宫的一条通路：Q 当输入的命令为E时，程序结束-With a Maze (m, n), said the long square maze, the maze entrance is a Maze (1,1), exports is the Maze (m, n), Maze (i, j) is equal to 0, said channel, Maze (i, j) is equal to 1, said barrier. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no path. The various commands and data input format is as follows: Enter the Labyrinth: C, followed by his party mn, where m is the maze of matrix rows, n is a maze of matrix columns, the next line of data is a maze m matrix, each row n- value, indicating an m* n matrix of the labyrinth a maze of pathways: Q when the input command for the E, the end of the process

数据库转换工具。该工具可以自动转换为SQL语言-Database conversion tools. The tool can automatically convert SQL language. . . . .

vfp数据库应用编程-Probe Database Application Programming

给paradox表增加、修改口令。-paradox to the table, change passwords.

ADO 封装好的数据库操作类 ，直接可以使用标准接口-ADO packaged good category database operations directly can use the standard interface

使用指针实现的自然归并排序。是学习指针和数据结构的很好的资料，要的就快下吧。-use of the natural target to achieve its stock ranking. Yes learning targets and data structure of good information to the fast are you.

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

输入学期总数 学期的学分上限 课程数 拓扑排序所形成的课程先修关系的边数 课程号及其学分 在各学期学期负担尽量均匀和 课程集中在前几个学期进行排课两种条件下进行排课-importation of the total semester credit semester courses ceiling few topological sorting as a result of the pre-course edge courses, and credits in the semester to semester burden of uniform and courses focused previous semester Course Scheduling for the two conditions under Course Scheduling