一个数据库连接池的完整代码，根据网上找来的代码改写。在jbuilder下测试完全通过 使用时注意修改properties文件。用于商业用途请与原开发者联系。原则...

改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。-improved algorithm greatly reduced for those zero motion vector search block redundancy, Meanwhile, more intense campaign of direct access to block large-scale search. That would improve the efficiency of search, the search results will not find the global optimum.

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task

还是进程调度，不过用不同的方法进行编写，里面有简要的流程图和实验目的和要求。-or scheduling process, but use different methods for preparation, there are brief flowchart and experimental purposes and requirements.

利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.

卷3为分拣和搜索，这是本书的第1个修订版，它是对计算机分拣和搜索的一流技术的最全面的研究，它扩展了卷1中数据结构的处理方法，将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案，和其效率的大量分析。本书该版的独特之处在于优化了的分拣，以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the computer and search the first-class technology of the most comprehensive study of its expansion Volume 1 data structure handling methods, the size of the database and external memory and storage are included. The book including computer methods carefully examined the options, and its efficiency lot of analysis. The book version of the unique features of the optimization is sorted, and right hash law and common law with the new theoretical expositions.

Magio牛的usaco源代码，希望和大家共同学习-Magio cattle usaco source code, hope and common learning

数据结构相关知识写的，二分查找的相关代码-2 minutes to find the relevant code

堆栈操作，用来实现大树精确加法，可以任意数的位数-stack