c编程技巧１００之１

压缩/解压缩类源码-compression/decompression source category

用来自动计算并判断某个数是否为素数的一段程序-Is used to automatically calculate and determine whether a number is prime section of procedural

伪随机数的产生程序 有m序列还有同余序列等等 用与嵌入信息位置的选择或密钥的制作-Pseudo-random number generation process has m sequences are congruent with and embedded in sequence and so the choice of location information or the production of key

在程序中动态创建菜单,菜单项中可以显示图标,比较美观-procedures in the creation of dynamic menu, the menu items will show icon, more beautiful

LLM快速算法

经典的乡农编码，算法比较简单，了解乡农编码的请顶。-classic Township coding algorithm is relatively simple to understand Township coding please roof.

ROI的ezw和huffman混合压缩编码，对感兴趣区域采用了huffman无损压缩，非感兴趣区调用ezw压缩-ROI ezw mixed and Huffman coding. the region of interest using a lossless compression Huffman, non-interest area called compression ezw

算术编码c程序实现-Program

Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a finite alphabet into substrings, whose lengths do not exceed a prescribed integer and a coding scheme which maps these substrings sequentially into uniquely decipherable code words of fixed length. The strings are selected so that they have nearly equal probability of occurrence. Frequently-occurring symbols are grouped into longer strings while occasional symbols appear in short strings. -Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a fi

8位无符号4-BIT ADPCM编码和解码程序-8-bit unsigned 4-BIT ADPCM encoding and decoding procedures