用循环单链表实现队列的基本操作,用循环单链表实现队列的基本操作,详见包内“代码”文档...

主分量变换，不要密码。-PCA transform, not passwords.

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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

资源描述利用三元组实现矩阵的简单运算，包括矩阵加法、减法、乘法和置换的运算，同时利用QT实现了简单的页面。本资源利用了三元组对矩阵进行运算，时间性能大大增加。

按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换-In accordance with the pre-order traversal non-recursive binary tree, binary tree recursive method will swap the left and right subtree

数据库转换工具。该工具可以自动转换为SQL语言-Database conversion tools. The tool can automatically convert SQL language. . . . .

用module来定义数据类型-module used to define data types

微软msde，数据库引擎得简单查许分析器-Microsoft MSDE database engines were simple check Xu Analyzer

IBM Lotus 123 操作程序例子-IBM Lotus 123 examples of procedures

这是一个用PB和SQL SERVER做的课程设计,模拟完成了,银行的开户,销户,存款,取款等功能.-with PB and SQL SERVER do curriculum design, simulation completed, the bank accounts, and marketing of households, deposits, withdrawals and other functions.

jobscope jobscope 在线求职人 1） PHP 2） mysql 数据库 3）类