交换法： 交换法的程序最清晰简单，每次用当前的元素一一的同其后的元素比较并交换...

SERVLET编程，一本很不错的书

《Java核心技术》一书的源码-"Java core technology," a source book

cadence原理图部分的教程,还是中兴公司为例子-cadence schematic part of the tutorial, or ZTE Corporation as an example

win2000驱动程序开发指南（中文版）-win2000 Driver Development Guide (Chinese Version)

JAVA语言实现与MYSQL的连接主要提供代码有JAVA 基础知识都可学习数据库 要自己建立-JAVA and MYSQL main link to Java code can learn basic knowledge database to establish their own

电子书名：应用时间序列分析 作者：何书元 出版：北京大学出版社 -EBook Name: Application of time series analysis Author: Dr Shu-yuan Publisher: Beijing University Press

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

Addison Wesley - .NET Framework Security-Addison Wesley- .NET Framework Security

una breve explicación sobre el framework java server faces