资源列表
weis_answer
- 数据结构与算法分析——C语言描述课后答案-Data Structures and Algorithm Analysis- C language to describe the after-school answer
SMatrix
- 以“带行逻辑链接信息”的三元组顺序表表示稀疏矩阵，实现两个矩阵的相加，相减，相乘的功能。稀疏矩阵的输入形式采用三元组表示，而运算的结果的矩阵则以通常的阵列形式列出，并输出每一行的第一个非零元的位置。此外，能实现把以三元顺序表表示的稀疏矩阵转换为用十字链表表示的稀疏矩阵，结果按十字链表的每一行和每一列输出稀疏矩阵-The " logical link with a line of information," said the triple sparse matrix sequen
C-P-P--Joseph-ring
- C++动态链表实现约瑟夫圈（可自由输入任意人数，从任意人开始）-C++ dynamically linked list Joseph ring (free input any number of any person from the beginning)
tingchechang
- 设停车厂只有一个可停放几辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达的先后顺序依次排列，若车场内已停满几辆汽车，则后来的汽车只能在门外的便道上等候，一旦停车场内有车开走，则排在便道上的第一辆车即可进入；当停车场内某辆车要离开时，在它之后开入的车辆必须先退出车场为它让路，待该车辆开出大门，为它让路的车辆再按原次序进入车场。-Located parking with only a few parked cars narrow channel, and only one do
datastruct
- 数据结构（C）用语言版 堆栈 队列 树datastrcut c语言版-c help
kmp-c-program
- 数据结构的kmp算法的实现和调试，进一步学习树与二叉树的数据结构算法。-Data structure kmp algorithm implementation and debugging, and further study binary tree data structure and algorithm.
sorting-algorithm
- 排序算法比较，可采用的方法有插入排序、希尔排序、起泡排序、快速排序、选择排序、堆排序、归并排序-Sorting algorithm comparison, the method can be used with insertion sort, shell sort, bubble sort, quick sort, selection sort, heap sort, merge sort
jiayou
- 贪心算法实现汽车加油问题贪心算法实现汽车加油问题-Greedy algorithm greedy algorithm automobile refueling vehicle refueling
maze
- 设二维数组maze[m][n]为0 表示此路可通,为1表示此路不通.入口是maze[1][1]出口为maze[m][n]且maze[1][1]=0, maze[m][n]=0. 编写寻找从入口到出口的一条最短路径的程序-Based two-dimensional array maze [m] [n] to 0 indicates that this road may pass, as 1 said that being the case. Entrance is maze [1] [1] exp
guandao
- 输油管道问题算法设计语言C语言编写输油管道问题算法设计语言C语言编写-Pipeline problem algorithms written in C language algorithm pipeline issue is written in C language
dwx_ex5BiTree
- 数据结构的实验，二叉树，用的VC++语言，MFC界面实现，界面上带着详细说明。-Experimental data structure, binary tree, using VC++ language, MFC interface implementation, the interface with detailed instructions.
C-
- C语言经典算法的书籍，很适合参加比赛的同学使用，这是我之前参加比赛收集的！-Classical algorithm C language books, the students participate in the competition is very suitable for use, this is my race before collecting it!