这是一个JAVA帮助文档,我在这里上传是为了帮JAVA初学者一个平台,让我们的JAVA事业能有一个新的台阶,我们这里为我们JAVA爱好者能够一起努力.为JAVA...

用C来实现数据库编程，里面的源程序提供大家参考。-C to achieve database programming, the inside source for your reference.

经典的选择排序算法，可以显示过程-classic choice algorithm can demonstrate that the process

值得收藏的一些ASP代码.rar 值得收藏的一些ASP代码.rar -copies of the some ASP code. Rar co pies of the some ASP code. Rar co pies of the some ASP code. Rar copies of the some ASP code. Rar

内部算法排序比较，按从小到大排序，快速算法，归并排序，冒泡排序等-Comparison of internal sorting algorithm, to sort by from small to large, fast algorithms, merge sort, bubble sort, etc.

这个是用C编写的有关Atmega169编写的ADC程序！-This is prepared by using C-related ADC program Atmega169 prepared!

power window related simulink simulation

用ansys有限元软件模拟鸟巢体育场钢结构-Using ANSYS finite element software simulation steel bird

It s time for web servers to handle ten thousand clients simultaneously, don t you think? After all, the web is a big place now

这题奇数是有数学方法的，可以构造出解。描述起来比较麻烦。 出一解的构造法： 首先在整个矩阵的最下面一行的中央置1， 然后向右下方向顺序填上2,3,4,5,6,7,…… 注意碰到底的时候就将数翻到上面去，碰到右边的时候就翻到左面去 比如5*5的幻方，如果1填在(5,3)处，2就应该填在（1,4）处，4就应该填在（3,1）处…… 另外，当原数的下方已经有数时，要将要填入的数填到原数正上方 仍举5*5幻方的例子，当5已填好（4，2）时，其右下方为1，不能把6填在那里，而应填在（3,2）处，即5的上方。 最后，一个特殊的点，右下角，这时也应当将新数填在右下角的上方。-odd that this a mathematical method of solution can be constructed. Description relatively trouble. From a structural solution to the law : First, the entire matrix of the bottom of his home a central, then under the direction of the right order to fill 2,3,4,5,6,7 ... to the end of the encounter will be a few turns to above, where the right time to turn left on to For example, the 5* 5 magic squares, fill in if a (5,3), the two should fill in (1,4), four should be filled in (3,1) Department ... Also, when the original number at the bottom of several that should be filled to fill several the original number is still above 5 5* For Magic Squares example, when the five have completed (4,2), for its lower right

ARM系统启动代码的――分析和开发，深入了解系统启动原理-ARM system startup code- the analysis and development, start