C++ Primer第三版 中文版，很好用的资料书记，基础且有实例

Linux英文原版图书系列-Linux网络架构-The_Linux_Networking_Architecture

C语言编程规范,老东东了-C programming language standard, the old Dongdong

c语言的始于末，用于新手，以及开发人员使用-c language began at the end for the novice, as well as developers

java纯正的 编码思想，使你一目了然，学习畅通无阻-pure java coding ideas so that you clear and unobstructed learning

jawa programming to make games

C++学习的有利助手，可使你的编程技术有所提高-C conducive learning assistants, will enable your programming technology has improved

C++ primer的源代码-primer C source code

美国麻省理工的算法导论,英文版,看后程序员宏观的能力培养有好处-Massachusetts Introduction to the algorithm, in English, read macro programmers the ability to cultivate good

通信系统仿真原理与无线应用代码 是一本不可多得的仿真书籍-Communication System Simulation Principle and wireless application code is a simulation of rare books

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