说明： 该系统应具有以下功能： （1） I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree中。 （2） E：编码（Encoding）。利用已建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。 （3） D：译码（Decoding）。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。 （4） P：打印代码文件（Print）。将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。 （5） T：打印哈夫曼树（Tree printing）。将已在 中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件TreePrint中。
The system should have the following features: (1) I: initialization (Initialization). Read from the terminal character set size n, and n and n characters right value, establishes a Huffman tree, and save it in the file hfmTree in. (2) E: encoding (Encoding). Has been built using the Huffman tree (if not in memory, reads from the file hfmTree), the text of the document ToBeTran encoded, and then putting the result in the CodeFile file. (3) D: decoding (Decoding). Huffman tree has been built using the file CodeFile the code will be decoded, the result is stored in the file TextFile. (4) P: Printing code files (Print). CodeFile in a compact format the document displayed on the terminal, one per line 50 code. While this character in the form of written documents CodePrin encoded file in. (5) T: Print Huffman tree (Tree printing). Would have been in the Huffman tree in an intuitive way (tree or recessed table form) displayed on the terminal, but this form of characters written to the file (2021-01-14, C/C++, 124KB, 下载0次)
此压缩包包含三个典型的数据结构入门实验的代码和使用说明和运行结果。程序注释详尽，说明中程序的要求以及运行结果详细，是进行数据结构学习的初学者不可错过的学习资料。
具体包含：十字链表与矩阵、哈希表、二叉树计算器实验三部分
The compressed package contains three typical data structures, which are introductory experiment code, operation instructions and operation results. The detailed annotation of the program shows that the requirements of the program and the detailed operation result are the learning materials that beginners can't miss to learn data structure.
Specifically include: cross linked list and matrix, hash table, two fork tree calculator, experiment three parts (2018-04-15, C/C++, 339KB, 下载1次)
数据结构链表的8个实验，约瑟夫环，一元稀疏多项式计算器，将元素X插入到链表中的适当位置，删除链表中所有大于mink且小于maxk的元素，就地逆置，删除线性表A中同时出现在表B和表C中的结点，构造三个循环链表，长整数的四则运算
8 experiments, data structure of Joseph ring, one dollar sparse polynomial calculator, the X element into the appropriate location in the list, delete all greater than mink and less than maxk of the element in the list, delete the linear form in situ reverse home, A also appear in table B and table C nodes in the structure of three a circular linked list, four long integer arithmetic. (2017-11-11, C/C++, 4756KB, 下载4次)
用哈希表实现一个拼写检查器spellchecker，给定一个字典， 输入一个文本后，输出拼写有误的单词，并给出用户可能想要表达的正确的单词
In this project, you ll build a hash table and see an example of hashing in action. Many applications,
including word processors, text editors, and email clients, include a spell-checking feature. A spell
checker s job is relatively simple. Given a list of correctly-spelled words (which we ll call a wordlist)
and the input text, the spell checker reports all of the misspellings (i.e. words that are not found in the
wordlist) in the input. When a misspelling is found in the input, a good spell checker will also suggest
words appearing in the wordlist that are somewhat like each of the misspelled words. (2015-01-14, C/C++, 475KB, 下载10次)
两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决：
n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加工，然后在M2上加工。M1和M2加工作业i所需的时间分别为ai,bi,1<=i<=n。流水作业调度问题要求确定这n个作业的最优加工顺序，使得从第一个作业在机器M1上开始加工，到最后一个作业在机器M2上加工完成所需的时间最少。
Two computers installed on the respectively two identical processors P1 and P2. The existing N tasks (JOBS) J1, ..., JN on these two computer processing. Each task Ji is divided into two sub-task ji1 and ji2 of this problem is equivalent to flowshop scheduling problem (the the N problem here is divided into 2N problem, so enter the number of tasks in the flow shop scheduling problem is even But taking into account the implementation of an odd number of applications GF, no special regulatory requirements), using a dynamic programming algorithm to solve: n jobs {1,2, ..., n} to the assembly line consisting of two machines M1 and M2 processing. Each job processing sequence is first processed on M1, then processed on M2. M1 and M2 processing operations i of the time required respectively ai, bi, 1 < = i < = n. The flowshop scheduling requirements determine the optimal processing sequence of n jobs, so start processing from the first job in the machine M1, to the last job on machine M2 (2012-11-16, C/C++, 2KB, 下载10次)
本书作者为Andrew.Binstock等。
本书重点关注的是实用，立即可用的代码，并且广泛讨论了可移植性和特定于实现的细节。本书作者介绍了一些用用但很少被讨论的算法，它们可用于语音查找，日期和时间历程，B树和索引文件，数据压缩，任意精度的算术，校验和数据验证，并且全面的介绍了例程，排序算法和数据结构。
本书只要求读者具有C语言的初级知识以及基本代数的相关知识。源代码经过测试符合ANSI标准，可以运行在UNIX下，以及BORLAND，Microsoft和Watcom的编译器上。
Book author Andrew.Binstock and so on. This book focuses on the practical and immediately available code, and extensive discussion of portability and implementation-specific details. The author describes some, but rarely discussed with the use of algorithms, which can be used for voice to find, date and time history, B tree and index files, data compression, arbitrary precision arithmetic, checking and data validation, and comprehensive introduced the routine, sorting algorithms and data structures. This book only requires the reader has a knowledge of C language primary and basic algebra knowledge. Source code has been tested meet ANSI standards, can run on UNIX, and BORLAND, Microsoft and Watcom compilers. (2010-12-20, C/C++, 31276KB, 下载3次)
用C实现的黑白棋源程序，有人工智能的人机对战，用算法树深度搜索，原始的C图形界面，turboC或TC编译器运行。网络上实现黑白棋大多选择VC++，并没有用C实现并且有人工智能的程序。
Implementation of Othello with C source code, there is artificial intelligence, human-machine gaming, with the depth of search tree algorithm, the original C-graphical interface, turboC or TC compiler run. Most of the network to achieve Othello select VC++, and did not realize and have artificial intelligence using C program. (2010-09-15, C/C++, 4KB, 下载12次)
用C语言实现数据结构中的哈弗曼编译器。可以求出n个字符的赫夫曼编码。建立函数输入二叉树，输出其赫夫曼编码。用户输入n个字符在电文中的使用频率（扩大100倍），并输入这n个字符，确定后系统给出这n个字符的赫夫曼编码。
With the C language data structures Havermann compiler. You can find the n-character Huffman encoding. The establishment of a function input binary tree, the output of its Huffman coding. User input n characters in the message in the use of frequencies (expanded 100-fold), and enter the n characters, and determined the system gives the n-character Huffman encoding. (2009-10-14, C/C++, 1KB, 下载28次)
建立一棵链表表示的二叉树，然后采用非递归先序访问二叉树，具体用一个指针栈(数组)来实现，且其最大容量为maxsize=50，二叉树根指针为T，若一个结点的左孩子和右孩子均为空，则为叶子结点，计数器加一，直到访问结束。
Binary tree expressed in the establishment of a linked list, and then visit the first-order non-recursive binary tree, specifically with a pointer to the stack (array) to achieve, and its maximum capacity of maxsize = 50, a binary tree the root pointer for the T If a node' s left child and right child are empty, for the leaf nodes, the counter plus one, until the end of the visit. (2009-08-31, C/C++, 12KB, 下载3次)
C语言进阶,包含以下的内容:C语言进阶－第一讲概述.pdf\C语言进阶－第二讲C语言复习.pdf\C语言进阶－第三讲编译汇编调试.pdf\C语言进阶－第四讲存储器与指针.pdf\C语言进阶－第五讲 数据结构与链表.pdf\C语言进阶－第六讲中断与驱动.pdf\C语言进阶－第七讲编码风格.pdf\C语言进阶－第八讲编写安全无错的代码.pdf\C语言进阶-lmalloc 第四讲代码.rar\C语言进阶－ASIX Win link list 第五讲代码.rar
Advanced C language, contains the following contents: C language Advanced- an overview of the first speakers. PdfC language Advanced- Second review stresses C language. PdfC language Advanced- Third-speaking compilation compiler debugging. PdfC language Advanced- Part four speakers with the pointer memory. pdfC language Advanced- Fifth speak with the linked list data structure. pdfC language Advanced- Sixth speak with the driver interrupted. pdfC language Advanced- seventh stresses coding style. pdfC language Advanced- eight stresses safety to prepare error-free code. pdfC Advanced language-speaking fourth-lmalloc code. rarC language of Advanced-ASIX Win link list code stresses the fifth. rar (2007-10-16, C/C++, 760KB, 下载64次)
单源点最短路径算法
* 本程序用来实现单源点最短路径（E.Dijkstra）算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中
* 每条边的两个顶点和权值由用户输入，格式：1 2 20
* 程序默认源点为第一个顶点
* 算法完成后输出路径长度和路径上的顶点
* 格式为：路径长度：目标顶点<-经过的顶点...<-源点
Single-source shortest path algorithm* This procedure used to realize single-source shortest path (E. Dijkstra) algorithm* The Turbo C2.0 compiler algorithm under the compiler through the process of** each of the two vertex and edge weights by user input, format: 1 2 20* default source for the first vertex* algorithm output after the completion of the path length and path of the vertex* format: path length: Target Vertex (2007-08-30, C/C++, 1KB, 下载33次)
K路归并算法
* 本程序用来实现K路归并算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中
* K由用户输入
* 用户选择需要归并的数据的个数
* 由程序生成随机数据，数据结构为链表，并展示给用户
* 然后程序告诉用户需要增加的虚节点的个数
* 并把虚节点加入到链表中去，最后进行归并
K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge (2007-08-30, C/C++, 2KB, 下载22次)