-
计算流体力学的方腔流计算
方腔流计算实计算流体力学经典算例,本程序是用Fortran编写的计算程序,对于对照或者进行二次开发都是很有帮助的
- 2022-07-02 04:17:29下载
- 积分:1
-
用C语言写的简单程序。屏幕会出现有趣的现象,还有动人的音乐,不错哟!...
用C语言写的简单程序。屏幕会出现有趣的现象,还有动人的音乐,不错哟!-C language to write a simple procedure. Screen be interesting phenomenon, touching music, good yo!
- 2022-12-10 10:15:03下载
- 积分:1
-
一个材料力学的源程序,用于计算简支梁在简单载荷作用下的变形。...
一个材料力学的源程序,用于计算简支梁在简单载荷作用下的变形。-a mechanical source, used in the calculation of simple beam in a simple load of deformation.
- 2023-07-12 06:50:03下载
- 积分:1
-
100个经典程序,主要是由C语言编写的经典程序,由易到难,非常适合新手学习...
100个经典程序,主要是由C语言编写的经典程序,由易到难,非常适合新手学习-100 classic program, mainly by the C language written in the classic procedure, Youyidaonan very suitable for novice to learn
- 2022-01-26 03:28:25下载
- 积分:1
-
The programme is about control panel.When you click it ,you can get message hand...
有关于控制面板的,当你单击的时候可以看到消息的处理过程-The programme is about control panel.When you click it ,you can get message handling process.
- 2022-03-15 18:55:54下载
- 积分:1
-
适于本很好的介绍c++ 6.0的书,适合有一定的编程基础的人阅读...
适于本很好的介绍c++ 6.0的书,适合有一定的编程基础的人阅读- suitable for the very good presentation c 6.0, the book suitable for a certain programming based on the reading
- 2023-03-04 00:20:05下载
- 积分:1
-
此为多函数的递推算法,又多个例子,初学C++的可以下回来
此为多函数的递推算法,又多个例子,初学C++的可以下回来-This is a recursive algorithm for Multi-function, but also a number of examples, beginner C++ Can come back next
- 2023-01-02 01:00:03下载
- 积分:1
-
Muhammad hegemony source, use the C language, run the console environment.
拳王争霸源程序,使用C语言编写,控制台环境运行。-Muhammad hegemony source, use the C language, run the console environment.
- 2022-01-24 13:01:48下载
- 积分:1
-
数据挖掘关联分析的最新研究进展和未来趋向 《Frequent pattern mining: current status and future directi...
数据挖掘关联分析的最新研究进展和未来趋向 《Frequent pattern mining: current status and future directions》 由权威科学家韩家炜等著-Correlation Analysis of Data Mining the latest research progress and future trends
- 2023-02-14 06:00:04下载
- 积分:1
-
选择法排序原理:一次选定数组中的每一个数,记下当前位置并假设它是从当前位置开始后面数中的最小数min=i,从这个数的下一个数开始扫描直到最后一个数,并记录下最小...
选择法排序原理:一次选定数组中的每一个数,记下当前位置并假设它是从当前位置开始后面数中的最小数min=i,从这个数的下一个数开始扫描直到最后一个数,并记录下最小数的位置min,扫描结束后如果min不等于i,说明假设错误,则交换min与i位置上数。-Selection sort works: each time the selected number of the array, note the current position and assume that it is behind a number starting from the current location of the minimum number min = i, from this number the number of start scanning the next one until the last one the number of , and record the location of the minimum number of min, after scanning, if min is not equal to i, instructions assume that the error, then the exchange of a few min and i position.
- 2022-08-07 23:09:54下载
- 积分:1