也跟上一篇一样，是我在一本书里收集的。 是语言基础，一看就懂，看不懂就是你还没有入门C语言。...

jbuilder设计思想，对学习jbuilder的朋友很有帮助-jbuilder design ideas, to learn jbuilder helpful friends

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小: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.

一本写的很好的电子书，绝对原创-To write a good e-books, absolutely original

大家可以参考一下-we can take a look

本附录按错误编号列出了所有Wi n s o c k错误代码。但要注意的是，该列表没有包括标记为 “B S D特有”的Wi n s o c k错误，也没有包括那些尚未正式列入规范的错误。此外，与Wi n 3 2错 误有着直接对应关系的Wi n s o c k错误列在本附录末尾。-errors by the No. appendix lists all Wi n s o c k error code. But it should be noted that the list does not include marked "S B D unique" Wi n o c k"s wrong, does not include those that are not formally included in the standard error. Moreover, Wi n 3 2 errors have a direct correspondence between the Wi n s o c k out of the wrong end of this appendix.

罗云彬的《Win32 汇编程序设计》随书源码光盘，压缩包中为ISO格式-"Win32 compilation of program design" With the book source discs, compressed format for ISO

此为有关粒子群算法的比较权威的书，内部由关于此算法的C源程序-here for the PSO algorithm authoritative book on the internal algorithm from the C source

Opensuse toolbox very good book

简洁的英文图像处理教程，比较简单易,enjoy it-concise English Image Processing Guide, relatively simple easy to enjoy it

《matlab编程百例》光盘代码11-20-"Matlab programming hundred cases" CD-ROM code 11-20