在 JAVA 游戏

Oracle BerkeleyDB--SQLitehttp--www_sqlite_com_cn-_files2.rar//bdb2

计算Fugit的二叉树期权方法 use Fugit binomial tree to calculate option value-Fugit calculation method of binary tree options use Fugit binomial tree to calculate option value

最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s

Fibonacci函数-Fibonacci function

题目：串基本操作的演示 含有测试结果和函数关系调用图-Title: string containing the basic operation of the demonstration test results and the function call graph

递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm

利用MD5函数产生随机的无碰撞的像素选择策略-The use of MD5 function produces a random collision-free pixel selection strategy

一个介绍Odbc的详细例子，看后，受益颇多。-introduced a detailed examples, see, a lot of benefit.