用C语言编写。数据结构，任意输入数值的折半查找。

AVL tree display format in two dimensional

在本机票预定系统项目的前一阶段，也就是概要设计阶段中，已经将系统用户对本系统的子模块功能做了详细的阐述，这些模块功能具体设计将在本报告中详尽得以叙述及阐明。 本阶段已在系统的概要设计的基础上，对机票预定系统做详细设计。主要解决了实现该系统程序模块具体设计问题。包括确定算法，数据结构，模块接口的使用，数据库的动态操作以及界面设计等。在以下的概要设计报告中将对在本阶段中对系统所做的所有详细设计进行详细的说明。 -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.

用C#编程连接到一个Access数据库，打开其中的一张表，在DataGridView控件中显示数据表的详细内容。

这是上完操作系统课时，做的实习设计，又实验的目的，分析，设计。采用的是用响应比作业调度算法。-This is while finishing the operating system lesson, the practice done is designed, the purpose to test again, analyse , design. That was adopted is to use responding it than the homework dispatcher s algorithm.

实现了二叉排序树的所有功能 建立，增，删，改，查 -Achieved a binary sort tree all the features of the establishment, increase, delete, change, check

邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结邓俊辉数据结构源代邓俊辉数据结构源代码邓俊辉数据结构源代码码邓俊辉数据结构源代码构源代码

用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.

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

1. 利用尾插法建立一个双向链表，并遍历双向链表。 2. 实现双向链表中删除一个指定元素。 3. 在非递减有序双向链表中实现插入元素e仍有序算法。 4. 判断双向链表中元素是否对称，若对称返回1，否则返回0。 5. 设元素为正整型，实现算法所有奇数排列在偶数之前。 6. 在主函数中设计一个简单的菜单调试上述算法。 -table