农夫过河问题

检查堆栈值的 C 语言源码-inspection stack value of C language source code

这是一个移动网络图书馆系统采用PHP。它将帮助学生对什么事情对图书馆管理系统过程的基础

Viterbi算法源程序,注释简洁,利于使用-Viterbi algorithm source, concise notes, beneficial use

学习指针的一个好例子，新手必下！绝对好用！高手还是不要下的好！-learning targets of a good example, and newcomers will under! Absolutely handy! Experts still do not have a good!

假设一个文件中出现了8种符号S0，SQ，S2，S3，S4，S5，S6，S7，那么每种符号要编码，至少需要3bit。假设编码成000，001， 010，011，100，101，110，111。那么符号序列S0S1S7S0S1S6S2S2S3S4S5S0S0S1编码后变成 000001111000001110010010011100101000000001，共用了42bit。我们发现S0，S1，S2这3个符号出现的频率比较大，其它符号出现的频率比较小，我们采用这样的编码方案：S0到S7的码辽分别01，11，101，0000，0001，0010，0011， 100，那么上述符号序列变成011110001110011101101000000010010010111，共用了39bit。尽管有些码字如 S3，S4，S5，S6变长了(由3位变成4位)，但使用频繁的几个码字如S0，S1变短了，所以实现了压缩。对于上述的编码可能导致解码出现非单值性：比如说，如果S0的码字为01，S2的码字为011，那么当序列中出现011时，你不知道是S0的码字后面跟了个1，还是完整的一个S2的码字。因此，编码必须保证较短的编码决不能是较长编码的前缀。符合这种要求的编码称之为前缀编码。要构造符合这样的二进制编码体系，可以通过二叉树来实现。-Suppose a file appears in eight kinds of symbols S0, SQ, S2, S3, S4, S5, S6, S7, then each symbol to be encoded, at least 3bit. Suppose encoding 000,001, 010,011,100,101,110,111. Then the symbolic sequence S0S1S7S0S1S6S2S2S3S4S5S0S0S1 encoded into 000001111000001110010010011100101000000001, sharing a 42bit. We found that S0, S1, S2 these three symbols the frequency of relatively large, the other symbols the frequency is relatively smal

mysql 5.x手册，全中文，mysql数据库管理开发必备。-mysql 5.x manual, all Chinese, mysql database management to develop necessary.

构造二叉树，对该二叉树中序，先序，后序遍历-Binary tree structure, the binary tree in order, preorder, postorder

程序1，2，3分别实现了vc++对access,BDE,DSN的访问；程序4串行化对象到数据字段，程序5从ODBC 动态读取数据，程序6 DAO组合框，程序7 ODBC的日期和时间 程序8 9，交互式的SQL工具；程序10在DLL中使用DAO-procedures were achieved vc right access, BDE, DSN visits; 4 Serial procedures objects to the data fields, procedures five dynamic read from ODBC data, procedures DAO portfolio Box 6, 7 ODBC procedures of the time and date 8 9 procedures, interactive SQL tools; 10 procedures in the use of DLL DAO

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;