纳迅河畔谈中国历史，也很有意思的

我收藏的数据结构与算法，与大家共享，谢谢支持-My collection of data structures and algorithms, and share, thanks to support

C语言圣经 The C programming Language By Brian W. Kernighan and Dennis M. Ritchie. -C language Bible, The C programming Language By Brian W. Kernighan and Dennis M. Ritchie.

linux嵌入式应用程序开发详解，是学习linux应用程序开发非常好的教材，通过本书的学习，你可以很快的进行linux应用程序开发。-linux embedded application development Xiang Jie, linux application development to learn a very good teaching materials and learning through this book, you can quickly conduct linux application development.

精通jbuilder必看的一本书，我们看了这本书才会发现jbuilder的功能原来如此强大！-proficient JBuilder Watchable of a book, we read this book be found that the function of the original JBuilder so strong!

提取eml文件或txt文件中的电子邮件地址-extraction eml files or txt file of e-mail addresses

,"the art of computer programming"这本书就不用介绍了，相信很多人都对它久闻大名。这是第三版第三卷中文版。字体非常清晰，适合收藏。 -, " the art of computer programming" would not have introduced this book, and I believe many people have heard so much about it daimyo. This is the third edition of the third volume in Chinese. The font is very clear, suitable for collection.

VC++MFC编程实例之八-VC MFC programming examples 8

一本详细讲解s3c4510的中文pdf书籍，从指令集到驱动开发都有-a Porting elaborate on the Chinese pdf books, from the instruction set to have driven development

校园自助银行系统,delphi源码,欢迎下载.-Campus self-help banking system, delphi source, welcome to download.

背包问题动态规划算法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.