vSQL server　的教务管理系统

这是一个生成组合序列的程序,而且是非递归的,代码非常精简,速度很快,序列是字典序的.-This is a combination of sequence generation process, but also non- recursive, code very concise, very fast, is the sequence of lexicographic.

求得一个4*4的方阵，各行各列及主负对角线上的元素均为可逆素数。-achieve a 4* 4 phalanx, the trip out and the main negative on the diagonal elements are reversible primes.

大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree

宾馆管理系统的数据库的报告,比较详细的内容,还是比较好的-Hotel management system, database, report, compare it in detail, it is quite good

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

数据结构中栈的相关操作,数据结构中栈的相关操作-data structure stack of operation, stack data structure of operation

经典矩阵运算问题求解-classic problem solving matrix operations

oracle 的 blob大字段类型操作例子-oracle big blob of field examples of the type of operation

Matlab入门篇介绍了一些基本的Matlab语句。并且有丰富的实例。-chapter introduces some basic Matlab statement. And there are abundant examples.

pb 源码 拷贝文件-pb code copy file