《C++STL程序员开发指南》书籍和源码

《C语言精彩编程百例》初学C语言的看看有一定的好处-"C Programming Language brilliant 100 cases" when a C language to see if there are certain advantages

Running Linux for embedded system

介绍JAVA的电子书，java2编程21天自学通，希望能对大家有用-Introduction JAVA e-books, java2 through self-study program for 21 days, hoping it would be useful

VC源码：《DirectShow开发指南》范例源代码-VC source : "DirectShow Development Guide" source code examples

数学模型-Mathematical model

汇编 问题 收集 源于aogo汇编学习论坛-Compilation to gather from aogo

Windows网络编程技术 出版社: 机械工业出版社 本书原作者：琼斯 奥朗德 本书开创历史之先河，首先完整披露了如何在32位平台上使用传统的API，如NetBIOS等； 以及如何运用一些新型网络API，如WinSock 2和远程访问服务（RAS）等。本书专门讨论Windows网络编程技术，覆盖Windows 95/98/NT 4/2000/CE平台。内容包括NetBIOS和Windows重定向器方法、Winsock方法、客户端远程访问服务器方法。 -Windows network programming technology Press : industrial machinery original author of the book publishers : Qiongshiaolangde the book created a precedent in history, the first complete disclosure of how the 32-bit platform on the use of traditional APIs if NetBIOS; and how to use some of the new network API, if WinSock 2 and Remote Access Service (RAS). The book devoted to the Windows network programming technology, coverage of Windows 95/98/NT 4/2000/CE platform. Includes NetBIOS, and Windows Redirector, Winsock, client server remote access methods.

是计算所买书籍的价钱，总共价钱的。输入单价和本数，则计算出总的价钱。-is calculated by the price of buying books, the total price. Input price and the number, then calculate the total price.

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

java API中文说明-Chinese Note