MFC类库详解，详解MFC各种类库的功能和使用-Detailed MFC class library, MFC explain a variety of library functions and the use of

Linux内核编程.zip-Linux kernel programming. Zip

论文写法，关于论文载体――WORD PDF格式文档的排挡等-Papers written on the paper carrier- WORD PDF format documents gears, etc.

对于学习verilog语言的综合，多年编程的总结-Verilog language learning for the integrated, multi-year programming summary

SD卡要点说明，对设计SD卡存储系统有帮助-SD card points shows that the design of SD card storage systems help

C++ e-book very good~

这是一个关于FPGA使用的文档，对于硬件开发很有帮助-This is an FPGA on the document, very useful for hardware development

插值..,不知道有没有问题,就是个示例,以后还多多学习-jiaocheng

sun公司的docs只有英文与日文的，这是中文版本的API-the docs only in English and Japanese, which is the Chinese version of the API

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA 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.