c++ primer中文版，一本很好的c++学习以及参考书。看了就知道了。...

希特勒的奋斗历史以及他的一些理念，看一下能理解他的想法的奇怪-Hitler" s struggle for history and some of his ideas, look at the idea he can understand the stran

网通九洲在线ivr开发-Netcom Jiuzhou Online IVR development

Algorithm Collections for Digital Signal Processing Applications Using Matlab.

OS引导记录手册(好),很详细介绍操作系统的引导过程。-OS boot record Manual (good), a very detailed guide to the process of the operating system.

A C++ Gotchas book must read

MFC Interview Question

C_C++程序员查询词典，用于帮助程序员查找相应的函数，非常方便，对程序员编程帮助很大-C_C++ Programmers inquiries dictionary, used to help programmers search the corresponding function, very convenient, very helpful for programmers programming

Visual C++精华篇 -Visual C essence Part

最近做了一个基于 RCP 的项目，感受颇深，觉得 RCP 有希望扭转 Java 桌面应用的颓 势。在项目中积累了一点经验与心得，拿出来与大家分享，希望能给 RCP初学者一点帮助。 我研究 Eclipse 插件开发已经有一段时间了，但是我并没有很系统的学习过 Eclipse 的插件开 发，往往只是做项目需要临时学的一点，所以讲的东西难免粗陋，请见谅。-Recently a project based on RCP, deep feelings, RCP think there is hope to reverse the trend of Java desktop applications. In projects that have accumulated experience and knowledge to share with you out, I hope that can help beginners RCP. I have studied the development of Eclipse plug-ins for some time, but I have not been very systematic development of Eclipse plug-ins, often only do projects that require temporary school, so inevitably things crudely speaking, please forgive me.

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.