登录
首页 » 算法 » Huffman编码实现压缩与解压缩

Huffman编码实现压缩与解压缩

于 2022-03-19 发布 文件大小:2.39 kB
0 189
下载积分: 2 下载次数: 1

代码说明:

Huffman编码是常见的编码之一,它的一个重要应用即为实现文件的压缩。本程序实现了利用Huffman编码进行文件压缩与解压缩

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

发表评论

0 个回复

  • 基于wcf服务和rest服务的示例代码
    应用背景解决如何编写REST和WCF客户端程序,去获取服务端的各种资源的方式,具有普遍意义。关键技术采用C#实现的基于wcf服务和rest服务的示例代码,提供针对get,post,put,delete的资源获取、序列化和反序列化方法,并采用silverlight实现web服务和数据库的连接.
    2022-03-14 17:49:08下载
    积分:1
  • lisp utility lib
    CLLIB is a varied collection of Common lisp tools and routines in CLOCC. Includes:  â–  "guess the animal" game; simple neural net (AI)  â–  autoload function and snarfing autoloads from other files  â–  basic definitions: package and path  â–  base64 encoding and decoding (data format)  â–  Rolodex: BBDB/vCard handling  â–  check values and types of the elements of a list  â–  Common Lisp HyperSpec access  â–  read/write CLOS object
    2022-02-01 20:05:38下载
    积分:1
  • //最小二乘直线拟合 m_FoldList为关键点(x,y)的链表 拟合直线方程(Y=kX+b)...
    //最小二乘法直线拟合 m_FoldList为关键点(x,y)的链表 拟合直线方程(Y=kX+b) -//linear least squares fitting m_FoldList as the key point (x, y) of Chain fitting linear equation (Y = C/56 b)
    2022-06-12 06:09:24下载
    积分:1
  • 这是一个猫吃老鼠问题的改进
    这是一个猫吃老鼠问题的改进算法。-This is a problem of cats eat rats improved algorithm.
    2022-02-09 18:09:13下载
    积分:1
  • C#滤波
    C#,滤波算法,实现方法,KalmanFa, 推荐下载,共同学习,共同进步!-electronic sphygmomanometer principle, download the source, learn together and progress together!
    2022-11-11 21:45:03下载
    积分:1
  • c语言实现基础数据结构
    这是c语言实现的一套基础算法库,包括向量,链表,队列,哈希等算法,并内置了迭代器操作,经过了完整的测试,欢迎使用
    2023-08-22 09:25:03下载
    积分:1
  • c++文件翻转
    Make your rcopy robust against all kinds of user or operation system errors. That means – check all return values for operating system errors (mostly I/O errors) and command line arguments for user errors. Stick to our files and interfaces that we provide via SubVersion. You may add methods (e.g. for file size or reversing the buffers content), but you are not allowed to change the signature of any method specified by us.
    2022-02-21 11:52:25下载
    积分:1
  • 0 / 1背包问题是一个N P
    0 / 1背包问题是一个N P-复杂问题,为了解决该问题,,将用回溯算法解决该问题。既然想选择一个对象的子集,将它们装入背包,以便获得的收益最大,则解空间应组织成子集树的形状(如图1 6 - 2所示)。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法,去找到可获得的最大收益。然后,对该算法加以改进,形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
    2022-02-26 09:06:08下载
    积分:1
  • 该程序把多种排序集中体现,包含了冒泡排序、快速排序等多种排序方,同时还详细讲述各种排序的分析,希望对编程初学者有一定帮助。...
    该程序把多种排序集中体现,包含了冒泡法排序、快速排序等多种排序方法,同时还详细讲述各种排序的分析,希望对编程初学者有一定帮助。-procedures for a variety of the sort embodied includes the Bubble Act, ranked Quick Sort and other ranking methods also explain in detail various sort of analysis, and I hope to the program will definitely help beginners.
    2022-04-12 02:04:39下载
    积分:1
  • 凸包C++实现
    此算法为凸包算法。即在一系列的点中找到他们之间的凸包节点,即能够包围所有节点的边缘节点。主要调用函数为convexHull函数,输入为点的坐标。
    2023-08-12 23:05:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载