资源列表
LabB
- (1)如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值。 (2)设a和b是两个用带有表头结点的循环链表表示的多项式。试编写一个算法,计算这两个多项式的乘积c = a*b,要求计算后多项式a与b保持原状。 -( 1) if the circular linked list representation of a polynomial, try to write a function Calc ( x ), a polynomial in x value a
Greed
- 利用贪心算法解决“部分背包问题”。这是个经典算法,实现的也比较完善,易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
CProgram
- 用C语言实现的关于栈、文件、排序、缓存区等的功能模拟。-Implemented in C on the stack, file, sort, cache and other analog functions.
KMP
- KMP算法,有好几种写法,配上图形,简单易懂。C/C++编写。-KMP algorithm, there are several writing, accompanied by graphics, easy to understand. C/C++ written.
paixu2.8
- 快速排序算法 按第一个元素排列或按随机元素排列 算法分析与设计-Quick sort algorithm or by the first element of array elements arranged in random
YSF_Head
- 这是带头结点的循环链表实现的约瑟夫环程序。-This is a circular linked list of nodes to take the lead implementation of Josephus program.
rat_in_maze
- 基于栈数据结构的迷宫老鼠问题C语言求解,在VS2010下编写并测试通过-C language to solve maze mouse problem based on a stack data structure
heap_sort
- 堆积排序(Heapsort)是指利用堆积树(堆)这种资料结构所设计的一种排序算法,可以利用数组的特点快速定位指定索引的元素。-Accumulation sort (Heapsort) is the accumulation of tree (heap) refers to the use of this data structure designed by a sorting algorithm can take advantage of an array of features to quic
SPFA
- SPFA算法的优化,写的比较详细,ACMER参考的绝佳资料-SPFA algorithm
binary_tree
- 文本为一个用c语言编写用于产生一个二叉树的源码文本。以三元组形式输入任意二叉树(以大写字母表示结点),求以任意一选定结点为子树的深度。如,在输入示范题中的二叉树之后,程序显示:Please select a node: 输入 ‘B’,回车后,程序显示‘3’。-Text for a written in c used to produce a binary tree source text. With three yuan group form input arbitrary binary tre
yanweimin.rar
- 严蔚敏《数据结构(c语言版)习题集》 参考答案,-Yan Weimin`s refered answers
lists.rar
- 1·能够创建链表,只须输入数据便能自动生成升序排列的单链表; 2·能够把已存在的两个自动升序的链表合并成一个链表,并保留其中的相同元素; 3·有友好的人机卷面;,To create one list, only the input data can be automatically generated single-linked list in ascending order 2 can has been in existence for two automatic ascend