-
本文讲述如何最大极限优化C语言编程代码的方法,很有用的!
本文讲述如何最大极限优化C语言编程代码的方法,很有用的!-This paper describes how to maximize the ultimate optimization C programming language code, very useful!
- 2023-08-09 22:05:04下载
- 积分：1
-
aix系统管理
aix系统管理-IBM内部培训教材，非常难得，因为市面上aix的资料很少-aix system management-IBM-house training materials, very rare, because very little information available on the market aix
- 2022-04-09 03:38:13下载
- 积分：1
-
ajax相关，prototype.js 文件
ajax相关，prototype.js 文件-failed to translate
- 2022-01-20 23:15:12下载
- 积分：1
-
The Java™ Tutorial Fourth Edition: A Short Course on the Basics By Sharon...
A hands-on guide to the Java programming language, The Java™ Tutorial, Fourth Edition is perfect for any developer looking for a proven path to proficiency with Java SE. This popular tutorial "from the Source" has been completely revised and updated to cover Version 6 of the Java Platform, Standard Edition.-The Java™ Tutorial Fourth Edition: A Short Course on the Basics By Sharon Zakhour, Scott Hommel, Jacob Royal, Isaac Rabinovitch, Tom Risser, Mark Hoeber
- 2023-07-23 11:30:04下载
- 积分：1
-
C++应用编程200个小例子，非常的实用和简单易懂，可以找到大部分的算法实例...
C++应用编程200个小例子，非常的实用和简单易懂，可以找到大部分的算法实例-CPP 200 examples
- 2022-02-12 01:02:49下载
- 积分：1
-
Qt的Linux grograming。好运。
Qt for Linux grograming .Good luck.
- 2022-03-25 17:05:13下载
- 积分：1
-
嵌入式linux和uclinux的介绍，以及minigui的介绍
嵌入式linux和uclinux的介绍，以及minigui的介绍-Embedded Linux and Basis of Uclinux presentation and the introduction minigui
- 2022-07-22 04:31:31下载
- 积分：1
-
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫...
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小: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.
- 2022-03-21 17:16:01下载
- 积分：1
-
讲述了WINDOWS下网络编程的规范
讲述了WINDOWS下网络编程的规范----Windows sockets-described network programming under Windows norms---- Windows sockets
- 2023-04-05 12:40:04下载
- 积分：1
-
eMeter introduction
eMeter introduction - including datasheet and eMeter technology
- 2022-04-20 02:20:00下载
- 积分：1
