搜索资源列表
字符排序
- 这是一个数据结构的常用算法,是关于字符排序的,输入一串字符用算法实现字符排序-This is a common data structure algorithms, is the sort of character input string of characters with character Sort Algorithm
C语言文件管理
- 操作系统中的文件是通过文件目录项来管理的,为了管理和查找的方便,按层次把文件目录项组织起来,同一层上的目录构成该层上的目录,第一层为根目录,一下为各层子目录。 假设以一串字符代表一个文件,每个字符表示一个记录。 在建立上述目录结构的基础上,建立相应的管理系统并要求完成以下各项操作: 1. 一次建立各个文件 2. 查访两个用户的所有文件 3. 查访用户sun 是否有文件AB 4. 删除用户sun的文件AC,然后在分别查访两个用户的全部文件,检查是否已经删除文件AC 5. 撤销用户sun,并检查是否
dashujiecheng
- 该源代码利用计算机模拟乘法竖式 计算阶乘 将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characte
字符频率统计
- 字符频度统计,采用Hash表即链表数组作为存储结构,是hash表的简单运用,还包括一定的文件操作-characters frequency statistics, the use of Hash Tables List that as a storage array structure, hash table is a simple application, but also some file manipulation
Huffman程序
- 为得到使电文总长最短的二进制前缀编码,则以n种字符出现的频率作权,设计一棵Huffman树,求出给定权值的字符对应的Huffman编码。-enable the message to be chief of the shortest prefix binary coding, while the n characters of frequencies for the right to design a Huffman tree, obtained the right to set the valu
文档编辑器
- 实现对输入文件的操作:保存文档 , 回到起始行 ,改变当前段的部分内容 , 删除当前, 查找字符串,段跳转, 帮助, 字符数 , 跳至下一行 , 跳至上一行 ,结束任务 ,读文档,改变当前段的全部内容, 阅览文档,写文档, 改为小写 等多种功能-realization of the right to operate the importation documents : to preserve documents, to return to the starting line, change t
kmpEx
- KMP算法是字符串模式匹配算法, 解决DBCS字符集的问题。-KMP algorithm is a string pattern matching algorithms, DBCS characters to solve the problem,.
BIT_ADD
- 关于对两个8位字符二进制的相加的算法设计 结果保存在第三方数组中-on two eight characters together in a binary algorithm design results stored in third-party arrays
smallTobig
- 这个程序是用C++来实现阿拉伯数字转为大写汉字.-the procedure is used to achieve C Arabic Chinese characters to uppercase.
haffmantree
- 按照data.txt格式输入权值&字符名覆盖原data的内容,就可以使用程序对由这些字符组成的字符串进行编码了,结果将输出至code.txt中-data.txt format with input weights & characters from the original data covering the contents it can be used to process these characters from the string of code and the result
guize
- The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first charact
zifuqiuzhi
- 字符和算术的表达式求值,用简单的C语言编写,思路简单易懂.-characters and arithmetic expression evaluates, with a simple C language, ideas simple and understandable.
JeromelOOs
- 准备一个文件,统计该文件中各种字符的频率,对各字符进行Huffman编码,将该文件翻译成Huffman编码文件,再将Huffman编码文件翻译成源文件。-prepared a document, statistics that document the frequency of various characters, on the characters Huffman coding, the document translated into Huffman coding documents, H
stringcmp
- 设A和B是长度相同的2个字符串。A和B的距离定义为相应位置字符距离之和。2个非空格字符的距离是它们的ASCII码之差的绝对值。空格与空格的距离为0;空格与其它字符的距离为一定值k。 字符串A的扩展是在A中插入若干空格字符所产生的字符串。在字符串A和B的所有长度相同的扩展中,有一对距离最小的扩展,该距离称为字符串A和B的扩展距离。 对于给定的字符串A和B,试设计一个算法,计算其扩展距离。 -Let A and B is the same length of two strings. A
shujujiegousuanfahuffamn
- 输入一段文本,统计其中字符出现的频率 设计相应的哈夫曼码 并完成对该段文本的编码与译码-input section of the text, statistics on the frequency of characters designed corresponding Huffman code and the complete text of the coding and decoding
FilterEnter(C++)
- 用C++编制字符过滤程序,C++编写,环境为VC++6.0-C filter characters preparation procedures, C, the environment for the VC 6.0
haffman_tree
- 我的一次数据结构课程设计HUFFMAN树的C++源代码,基本功能有: 1.显示27个字符的haffman编码; 2.输入m个字符,对应27个字符的权值进行haffman编码; 3.输入一串字符,用已经定义的haffman编码输出;-a data structure course design Speed HUFFMAN tree C source code, the basic function : 1. show 27 characters haffman coding; 2. m
intcalculate
- 以字符形式从终端输入语法正确的,不含变量的整数表达式。利用算符优先关系,实现对算术四则混合运算表达式求值。-to form characters from the terminal input grammar correct, the non-integer variable expression. Operator priority relations and the realization of the four arithmetic operations mixed expression
Characters.quick.sorting.algorithm
- 字符的快速排序算法 字符的快速排序算法 -Characters.quick.sorting.algorithmCharacters.quick.sorting.algorithmCharacters.quick.sorting.algorithmCharacters.quick.sorting.algorithm
reverse--characters
- 利用递归函数原理,输入五个字符,再将这五个字符逆序输出-input 5 characters and output them reversedly based on recursive function
