visual c++ 一本基础的，很有意思的书。有关于许多应用的封面。

《细说民国》----《细说中国历史丛书》第9卷 本书《细说中国历史丛书》系已故旅美历史学家黎东方先生所著。作者以生动别致的“讲史”形式详细讲述了自秦汉到中华民国各个历史时期的重要人物和事件。书中不但将各种事件和人物剖析、介绍得清清楚楚，而且还加上作者自己的判断和评论，让读者更深刻、更有兴趣地了解历史真相。作者还善于用现代人所了解的名词去解释历上的各官职和家族关系等，使全书显得通俗易懂。

数学函数,所在函数库为math.h、stdlib.h、string.h、float.h-Mathematical functions, where the function library for math.h, stdlib.h, string.h, float.h

经典的unix书籍，看了它之后，再看unix、linux的代码就非常容易明白-classic books, read it, look at Unix, Linux code is very easy to understand

C语言的制作的900个案例，希望能对大家有些用处-C language production of 900 cases in the hope of some use to everyone

大量的例题，详细的讲解。这是一本不错的书籍，尤其适合初学者用。值得你下载。-Example a lot of detailed explanations. This is a good book, especially for beginners to use. Worth your download.

program for astar algoritham to find cheapest path between two nodes

java编程可以实现自动获得ip地址，赶快下载看看哦-java programming can be achieved automatically obtain ip address, download as soon as possible look at the oh

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

一本很好的关于数据挖掘的支持向量机应用的书-a good on Data Mining Application Support Vector Machine book

计算机密码学－通信中的保密与安全(1)比较详细的介绍了一些常用的密码.-Computer cryptography- the confidentiality of communications and security (1) a more detailed introduction a number of commonly used passwords.