SuijiShu

经过调试后运行正确的直接插入排序和希尔排烃-after running directly into the correct sequencing and Hill expulsion

实用数据结构教程,让你学习数据结构不用愁,呵呵!希望这对你有用,能帮上一点忙!-Practical Guide data structure, so you learn not worry about data structures, Oh! Hope this useful to you, we can help!

C语言数据结构知识原代码 C语言数据结构知识原代码C语言数据结构知识原代码-C language data structure knowledge of the original code C language data structure knowledge of the original code C language data structure knowledge of the original code

数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)

以一个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).)

libaly for orcad 16.2

数据结构各种经典排序法集锦，包含了几种最常用的排序法(various data structure classic sort magazines, including several ranking of the most commonly used method)

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s

专业数据库程序，人人都可以使用，希望可以给大家带来帮助。-Professional database program, everyone can use, I hope you can help.