资源列表
crossRiver
- 三个野人三个和尚渡河问题，要求岸边和尚数目不少于野人数目-Three wild men to cross the river three monks and asked for the number of not less than savage shore the number of monks
MONKEY
- 数据结构线性表中的循环单链表的应用实例(c语言实现)-Linear list data structure linked list in a single cycle of an application example (c language)
biaodashi
- 数据结构中线性结构应用堆栈实现表达式求值-Application of the linear structure of the data structure to achieve expression evaluation stack
a
- c语言编写的通讯录 主要是练习链表操作 还请多指教-c book is mainly written in operation also Pleased to meet you practice list
knapsack_problem
- 很全面的关于动态规划中一类很基本但是变种很多的背包问题的资料!-knapsack problems are a class of basic dp problems.This file is comprehensive!
hash
- Hash Implementation in C programming.
BST
- Binary search Tree implementation.
Dijkstra
- 主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。-DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.
searchthemaxandmininarray
- 分治思想是算法中很常用的一种技巧。在N个数中求最小值Min和最大值Max，我们只需分别求出前后N/2个数的N/2个数的Min和Max,然后取较小的Min,较大的Max即可（只需较大的数和较大的数比较，较小的数和较小的数比较，两次就可以了）。-You can use the procedure to find the Minnumber and the Maxnumber in the array.
text
- 分别从8个文件里提取同样数据结构的数据，用关键字排列，然后输出，文件内容2W个此数据结构，大概样子如下： Key: 3047 Protein: DIP-3047N Degree: 4 Linked-protein(s): DIP-3048N DIP-3049N DIP-3050N DIP-3153N Key: 3048 Protein: DIP-3048N Degree: 2 Linked-protein(s): DIP-3047N DIP-3096N
DataStrustion_C_
- 数据结构C#版，基本原理与C语言一样，只是里面的语言是C#编写-C# version of the data structure, the basic principles and C languages, but which written language is C#
AdjacencyMultilist
- 这是个图的深度和广度遍历算法，主要是巩固数据结构的内容，对人启发非常大-This is a graph traversal algorithm for the depth and breadth of the main contents of the consolidation of data structure, inspired by a very large human