登录
首页 » Visual C++ » LW-LZ78

LW-LZ78

于 2014-04-27 发布 文件大小:1KB
0 247
下载积分: 1 下载次数: 9

代码说明:

     实现以下的无损数据压缩方法    LZ78和LZW算法; 给定若干个输入的字符串流,应用所编写的算法实现压缩,计算压缩比,然后再将压缩的码流进行解码,同输入的字符串流进行比较,判断输入输出码流是否一致。(Achieve the following lossless LZ78 and LZW data compression algorithm certain algorithms to a given input string stream to achieve compression applications written to calculate the compression ratio, and then decoding the compressed code stream, with the stream input string , and determines the input and output streams are the same.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • MyUpdate
    外挂自动功能模块,可单独使用,不少人没有自动更新外挂功能,里面注释很清楚,有需要的请下载。(In automatic function module, can be used alone, many people do not automatically update the external functions, which notes are very clear, there is a need to download. )
    2014-09-19 11:48:37下载
    积分:1
  • Windows 公共对话框的源代码,包含
    Windows 公共对话框的源代码(public dialog Windows source code)
    2005-02-13 14:10:37下载
    积分:1
  • Cwanquanshouche
    嵌入式学习资料 C语文完全手册 嵌入式学习资料 高级c(c language)
    2014-05-09 16:57:51下载
    积分:1
  • multimedia
    第十一讲 多媒体编程 第十一讲 多媒体编程 (XI XI speakers talk about multimedia programming multimedia programming)
    2008-05-27 15:09:47下载
    积分:1
  • vc++2010写的txt文本信息转化为BMP图片信息
    vc++2010写的txt文本信息转化为BMP图片信息,真正地信息在形成图片数据后注入的隐藏信息,这里没有进行转多个图片,可以自己加入转多个图片。隐藏信息的格式进行变更(vc++2010 write txt text information into BMP image information, the information actually injected into the formation of image data is hidden information, there is no carry to multiple pictures, you can add yourself to multiple images. Changes the format of hidden information)
    2013-06-21 18:52:47下载
    积分:1
  • SplashWnd
    splashwnd 窗口开始画面设置,主要针对VS2010的特定设置(Splashwnd )
    2015-01-30 16:58:03下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • Project5
    针对大型集群存储系统中磁盘SMART信息,对磁盘故障进行预测(failure predict)
    2017-03-29 20:25:36下载
    积分:1
  • C
    说明:  C++DES加密之源程序解释,精典,应该有人需要(DES encryption of the source explained that the classical, someone should be required)
    2009-03-09 20:59:14下载
    积分:1
  • VC下COM实例
    VC下COM编程的具体实现(VC COM programming under a concrete realization)
    2004-12-09 14:27:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载