it is good book for study c++

asp编程完全手册，适合新手！里面有大量实例和详细介绍，相信是你入门的好帮手！-asp programming entirely manual for novice! Where there were numerous examples and detailed information, I believe that your entry is a good helper!

OFDM与MC-CDMA技术的比较与MC-CDMA技术的一些相关介绍-OFDM and MC-CDMA technology, compared with the MC-CDMA technology, introduced a number of related

这是关于进化算法的电子书，书需要支持djvu的阅读器阅读。-This is the evolutionary algorithm on the eBook, on the need to support djvu reader reading.

介绍C++的基础知识，包括类，对象，以及编程的一些基础知识。-Describes the basics of C++, including classes, objects, as well as some basic knowledge of programming.

是学开发complier 的好书,是本分析LCC 的好书,作者用了大量的图,很清晰,有助于理解编译原理, a book to teach you how to develop c complier.-Compiler development is the study of the book, is the analysis of LCC

讲的是C++的编程技巧和注意事项，很多都是自己平时不太注意但又很重要的内容，绝对经典。-Talking about C++ programming skills and attention to matters, many of them are not usually pay attention to their own very important but the content is absolutely classic.

ORACLE的SQL语句使用技巧-ORACLE SQL Skills

C语言库函数大全,介绍C库中的API函数及其功能-C language library function Guinness on C library functions of the API function and its

0_1背包问题,回溯法解背包问题 0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一

Windows编程基础，一些基本知识，适合新人入门学习-Windows programming based on some basic knowledge for new entry-Learning