AD7705 and the use of thermistor to detect the actual temperature

哈夫曼huffman压缩编/解码 内含压缩和解压的源代码(C语言)和可执行程序-Huffman compression encoder/decoder compression and decompression containing the source code (C language) and enforceability procedures

24位BMP转换为RGB565的BMP工具-24 BMP conversion of the BMP tools RGB565

哈夫曼编码树算法-Huffman coding Tree Algorithm

分页内容 很详细自己看吧 不多说上来拿东西的哎-Page content in great detail for yourself to come and collect more than say the last thing hey

自己编写的一个简单的C语言实现的HUFFMAN编码实现的小程序，适合初学者。-I have written a simple C-language implementation of HUFFMAN coding a small program, suitable for beginners.

应用VB.net开发，实现数据压力与解压缩的讲解；处理压缩数据流实例-VB.net application development, data compression and decompression of the pressure on deal with compressed data stream example

文件自动解压缩程序-documents automatically extracted

队列应用-求迷宫问题-Queue application-seek maze problem

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.

文件为H.264编解码器 仅供参考 包括windows版本和DM642版本-Document for the H.264 codec is for reference only, including versions of windows version and DM642