资源列表
0-1
- 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-At 0/1 knapsack problem, there is a need for a capacity of c to load the backpack. N items from a selected items into the backpack, each i
three_methods_sort
- 三种排序算法比较，冒泡算法，选择算法，快速算法。-Comparison of three sorting algorithms, bubble algorithm selection algorithm, fast algorithm.
Fibonacci
- 主要指出了Fibonacci数的算法和相关的一个简单的例子，算法虽小，作用不小。-Main pointed out that the number of the Fibonacci algorithm and related example of a simple algorithm may be small, not a small role.
DataStructureAlgorithms
- 数据结构中最常用的算法，每个算法都集中了先辈们的智慧，经典合集。-The most commonly used data structure algorithms, each algorithm has focused on the wisdom of the ancestors, the classic collection.
LCA
- 最近公共祖先(LCA)，转化为 RMQ 用线段树解决-Recent public ancestor (LCA), into the tree line used to solve RMQ
ssssfsdfs
- 网银在线支付接口源码 -on line connent
ShortDistance
- 或得一个连通图两两之间最短路径的代码，算法导论上的算法，自己实现的-a funtion to get the shortest distance between each to noeds in a graph
circbuf-1.0
- 循环队列，C语言版本，可用于生产者消费者策略使用-Circular Queue, C language version of the strategy can be used for producers of consumer use
1
- 数据结构（C语言版）中关于数制转换的内容-Data structure (C language version) converted on the contents of a number of system
ImprovedEbulliton
- 冒泡法改进： 1.若某次循环中没有数据交换过,则可认为数据已经有序了,不必再进行循环了,可在程序中设一变量Flag 用来标识有无数据交换 2.如果在一次循环中,最后的某些元素没有交换过,则说明后面这些元 素的顺序已排序,下次循环可不对其进行比较-Bubble Act to improve: 1. If there is no cycles in a data exchange, and may think the data has been orderly, and no long
Stack
- 简单模拟栈的操作：包括栈的初始化，压栈，栈顶元素弹出以及取栈顶元素；采用C实现-Analog stack easy steps: including the stack initialization, push, pop elements as well as the Top-Top-check elements implementation using C
tu
- 数据结构，实现图的邻接创建和各种遍历遍历（中序，前序，后序）-Data structure, adjacent to the creation of implementation plans and a variety of traversal traverse (in sequence, the former order, after the sequence)