-
一个在VC下编写的一维随机元胞自动机小程序，
一个在VC下编写的一维随机元胞自动机小程序，-VC in a prepared one-dimensional random cellular automata applet,
- 2022-01-26 05:12:18下载
- 积分：1
-
霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码...
霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.
- 2022-03-26 01:11:34下载
- 积分：1
-
LZW和LZRW压缩算法源代码
LZW和LZRW压缩算法源代码-LZW and the LZRW compression calculates the law origin code
- 2022-03-10 01:11:29下载
- 积分：1
-
相对简单的小编程序的编码程序
比较简单的行程编码的小程序-relatively simple trip to the small coding procedures
- 2022-12-14 04:00:03下载
- 积分：1
-
Quick Mutli Search算法，对QuickSearch算法的改进，支持一次搜索多个子串、正/反向查找、不区分大小写查找...
Quick Mutli Search算法，对QuickSearch算法的改进，支持一次搜索多个子串、正/反向查找、不区分大小写查找-Quick Search algorithm, right QuickSearch algorithm, to support a number of search-string is/Reverse Search, Search is case insensitive
- 2022-06-16 10:27:20下载
- 积分：1
-
用STL实现哈夫曼编码，如果STL学会不去读它。
用stl 实现的哈夫曼编码，要是没学过stl 的就不要看了。-with stl achieve Huffman coding, if stl learned not to read it.
- 2022-05-26 16:47:45下载
- 积分：1
-
0_1背包问题使用一个给定n种去的动态规划解法…
0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
- 2023-04-12 03:25:02下载
- 积分：1
-
rar under linux software, linux system after installation you can extract the ra...
linux下的rar软件，安装后linux系统下就可以解压rar以及相关的文件了。-rar under linux software, linux system after installation you can extract the rar and related documents.
- 2022-03-17 06:48:03下载
- 积分：1
-
Video of the source code, can refer to for beginners, very inspired. I wish you...
视频的源代码，初学者可以参考，很有启发的。祝大家学c#快提高-Video of the source code, can refer to for beginners, very inspired. I wish you all learn c# Soon improve
- 2022-02-12 21:10:11下载
- 积分：1
-
VC++源代码，单文档数据库应用程序，用VC++编写的
VC++源代码，单文档数据库应用程序，用VC++编写的-VC++ source code
- 2022-04-10 05:26:29下载
- 积分：1
