改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。...

医药及销促系统，自带数据库-medicine and promote sales systems, onboard database

采有C++模板实现的一个数据结构"链表"，可以进行增加，删除，修改等20多个成员函数。 本程序适合初学数据结构的朋友们。

案例一 贪吃蛇游戏 案例二 计算器 案例三 黑白棋游戏 案例四 迷宫问题 案例五 扫地雷游戏 案例六 速算24 案例七 数据结构CAI系统 案例八 进程调度 案例九 存储管理分区分配算法 案例十 通讯录 案例十一 学生成绩管理 案例十二 工资管理 案例十三 图书借阅管理 案例十四 教师工作量计算 -case a huge memory game two cases calculators Case 3 Case 4 game reversi maze problem cases five outbound mine sweeping Case 6 game speed count 24 cases seven CAI system data structure eight cases process scheduling nine cases storage management district allocation algorithm 10 cases of 11 cases of student directories performance management salaries 12 cases 13 cases of books to borrow 14 teachers Case Workload Calculation

关于自适应滤波的一系列程序，包括二进制信道均衡，噪声对消，信号增强等，斑竹，该加精了吧？-adaptive filter on a series of procedures, including binary channel equalization and noise cancellation and signal enhancement, fed, the rate is honed?

在本机票预定系统项目的前一阶段，也就是概要设计阶段中，已经将系统用户对本系统的子模块功能做了详细的阐述，这些模块功能具体设计将在本报告中详尽得以叙述及阐明。 本阶段已在系统的概要设计的基础上，对机票预定系统做详细设计。主要解决了实现该系统程序模块具体设计问题。包括确定算法，数据结构，模块接口的使用，数据库的动态操作以及界面设计等。在以下的概要设计报告中将对在本阶段中对系统所做的所有详细设计进行详细的说明。 -In the ticket reservation system project in the previous phase, which is a summary of the design phase, the system user has a subset of the system modules have done a detailed, specific design features of these modules will be detailed in this report can be described and explained . This phase of the outline design of system based on air ticket reservation system do the detailed design. The main solution to the achievement of specific program modules of the system design issues. Including the identification of algorithms, data structure, the use of module interfaces, databases, dynamic operation, as well as interface design. In the following report will outline the design at this stage of the system has done all the detailed design detail.

作者对ADO进行封装并演示了它的使用-writer for Packaging and demonstrated its use

完全由C语言实现的图的相关操作，就是清华大学 数据结构书里的图的所有算法的实现-Solely by the C language implementation of related plans to operate, that is, Tsinghua University, the data structure of the book" s map of the implementation of all algorithms

解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.

这是同学信息资料管理系统的设计，包括设计说明！-This is a classmates information manager design including design specification.

利用桶排序给数组a排序，建立的桶为b和e，其中b为含有十万个桶，e为只有一个链表的桶，然后对b和e使用插入算法排序，比较两种算法的时间，b需要40毫秒左右，e需要9到10分钟。-use barrels a ranking to the array, in order to establish the barrels of b and e, b to contain 100,000 barrels of only one e Chain barrels, and then to b e used to insert sorting algorithm, the algorithm for comparing two hours, b needs about 40 milliseconds, e needs 9 10 minutes.