tgxrryy

数据结构与算法分析用C语言描述第二版英文版(Data structure and algorithms to analyze C language describe second edition English version)

说明：  迪杰斯特拉算法，用c++语言实现，适用于本科数据结构教学. (Dijkstra，implemented by c++， can be used in the course of DS for college students)

面试经常遇到的大数相乘问题，代码简洁易懂-Interviews are often encountered in large numbers multiply problems, the code easier to understand

一个俄国人写的内存数据库系统，非常具有参考价值-A memory database system writing by a Russian with good reference worth.

使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)

卷3为分拣和搜索，这是本书的第1个修订版，它是对计算机分拣和搜索的一流技术的最全面的研究，它扩展了卷1中数据结构的处理方法，将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案，和其效率的大量分析。本书该版的独特之处在于优化了的分拣，以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the computer and search the first-class technology of the most comprehensive study of its expansion Volume 1 data structure handling methods, the size of the database and external memory and storage are included. The book including computer methods carefully examined the options, and its efficiency lot of analysis. The book version of the unique features of the optimization is sorted, and right hash law and common law with the new theoretical expositions.

以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。 1.基本要求 （1）首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i，j，d）的形式输出。其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向。如下图所示迷宫。从入口（1，1）到出口（8，8）的求解结果如下： （1，1）（1，2），（2，2）（3，2）（3，1）（4，1）（5，1）（5，2）（5，3）（6，3）（6，4）（6，5）（5，5）（4，5）（4，6）（4，7）（3，7）（3，8）（4，8）（5，8）（6，8）（7，8）（8，8）(The labyrinth is represented by a m*n rectangular array. 0 and 1 represent the pathways and obstacles in the labyrinth respectively. Design a program for any set of maze, find a way from the entrance to the exit, or draw no conclusion of the path. 1. basic requirements (1) first implement a stack type with linked list as storage structure, then write a non recursive procedure to solve the maze. The path obtained is output in the form of three tuple (I, J, d). Among them: (I, J) indicates a coordinate in the labyrinth, and D indicates the direction of going to the next coordinate. As shown in the labyrinth below. The results obtained from the entrance (1, 1) to the outlet (8, 8) are as follows: (1, 1) (1, 2), (2, 2) (3, 2) (3, 1) (4, 1) (4, 1).)

数据结构图论问题，初学数据结构的学生可以通过这些简单的问题熟悉数据结构课程(Data structure graph theory problem, learning data structures for students through these simple questions can be familiar with the data structure courses)

此程序用于解决8皇后问题，运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)

该软件模拟数据结构的算法实现-the software simulation data structure Algorithm