资源列表
8-fortran-chazhi
- 常用的集中插值程序 fortran 双线性、克里金等-fortran chazhi
HEAP-sort-program
- 堆排序程序，对结构体数按某个值KEY的大小降序排序-Heap sort program, the number of structures according to the size of a value in descending order KEY
link_sort
- 链表实现排序,实现和数组排序一样的功能，简单一点，但是功能还行-Sort list implementation, implementation, and the same array sorting functions, simple point, but features the line
1163
- 最大流算法，差分约束系统， 最大流算法，差分约束系统， 最大流算法，差分约束系统，的代码实现-the algorithm of maxflow askfasfka alskdfja aldfjas askdjfa askdlfjad askdf askfj askdfj askfjaf
ALG
- heap sort 用c++实现归并排序-heap sort implementation using c++ merge sort
Joseph-cycle
- 是一个数学的应用问题： 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 -The application is a mathematical problem: given n individuals (in numbers 1,2,3 ... n, respectively) sitting around a round table a
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。用2种方法实现背包问题，用C语言编写，数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a se
hufuman
- 设计哈弗曼编码和译码。要求编码和译码一个字符，一定要创建它的字符结点和对应权值，否则，不可以。-Design Hafu Man encoding and decoding. Requirements of a character encoding and decoding, we must create a character of its nodes and the corresponding weights, otherwise not.
[Solution]LTC_Man_Contest
- 有助于编程,是男人八题的代码，可以帮助很多爱好ACM的人-It s good for acmer.Eight question is a challenge for many acmer,so it will help you.
3-4Bellman-Ford
- 传递闭包在算法中是一种很重要的工具，可以帮助我们ACMer判断两者之间是否有联系-Bellman-Ford it s very important in programming.
doubly-linked-list
- 数据结构的双向链表及单向链表，通过增加或删除节点来增加或删除数据，方便快捷。-Doubly linked list data structure and one-way linked list, by adding or removing nodes to add or delete data, and convenient.
my_dancilinklist
- 输入单词，要求以单词首字母为顺序，将单词插入数据链表中。-Enter a word, asked for the order of the first letter of the word, the word in the list insert data.