Visual basic + sql server2000学员管理系统原代码

四种排序算法(交换排序 冒泡排序 quick sort排序 mergesort归并排序 )源码，以及各种算法排序效果的对比。-Four kinds of sorting algorithms (exchange sort bubble sort quick sort sort mergesort mergesort ) source code, as well as comparison of various algorithms to sort results.

pb做出的outlook界面框架,可以直接用在管理信息系统中来使用.-pb"s outlook interface framework, can be directly used in the management information systems to use it.

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

工作

霍夫曼编码前缀编码Huffman Coding-Huffman Codeing

索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.

VFP做的报表与标签-VFP do with the labeling statements

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

专家库管理系统(多用户)-expert database management system (multi-user)

ssd5 exercise 4 ssd5 exercise 4 ss d5 exercise 4 -ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4