通过现有的人口数据结构特点，对其进行拟合分析后进行长短期的预测...

用VC++实现数据结构中：在指定的位置上，线性表的插入 -Using VC++ implementation: ~ linear table data structure insertion

利用哈希函数对学生姓名进行最优化查找 可选择从键盘输入和文件输入,需输入名字最大长度-hash function to the students find the most optimal choice from the keyboard input and the input document, name must be imported maximum length

image存取到SQL，图片格式文件直接存储到SQL数据库中，支持JPEG，BMP等格式

中后序列求二叉树，c语言，源码有注释，可供学习使用。-posterior sequence for Binary Tree, c language, a source notes for studying.

计算机算法设计，用于设计贪心算法，你们懂得-Computer algorithms designed for the design of dynamic programming, you know

2005软件工程师考试下午编程题源代码-2,005 software engineers at the examination program that the source code!

清华大学版数据结构的一下试题资料，望对大家有帮助-Tsinghua University, version data structure questions about the information, hope for all of us help

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

一个数据库课程设计里报刊订阅管理系统，包含几个角色用户，系统管理员，投递员， 有网页形式显示的界面

无向网生成最小树，基于VISUAL C++开发，数据结构-Undirected network generate minimum spanning tree, based on the VISUAL C++ Development, data structure