-
工包含五个matlab 小题目,并附有解决方案,适于初学者使用
工包含五个matlab 小题目,并附有解决方案,适于初学者使用-Works includes five matlab small topic, with solutions, suitable for beginners to use
- 2023-01-07 08:45:03下载
- 积分:1
-
winsock的局域网通信系统支持c/s单工通信
winsock的局域网通信系统支持c/s单工通信-winsock LAN communications system to support the c/s single-communication
- 2023-05-01 10:40:04下载
- 积分:1
-
c语言写的FFT变换源码,有多个版本,经测试,还比较好用
c语言写的FFT变换源码,有多个版本,经测试,还比较好用-c language source code of the FFT transform, has multiple versions, tested, is still relatively easy to use
- 2022-01-21 22:39:30下载
- 积分:1
-
内存管理
memory management
- 2022-07-10 03:27:20下载
- 积分:1
-
pcb转SCH攻略
pcb转SCH攻略-(protel)pcb转SCH攻略-(protel)-pcb switch SCH Raiders- (protel) pcb switch SCH Raiders- (protel)
- 2022-03-05 04:55:34下载
- 积分:1
-
改进的虚拟激励法,用于大型结构的随机频域计算,在建筑、航天、机械领域已得到广泛的应用。...
改进的虚拟激励法,用于大型结构的随机频域计算,在建筑、航天、机械领域已得到广泛的应用。-Improved pseudo-excitation method for the large-scale structure of random frequency-domain calculation, in the construction, aerospace, mechanical field has been widely used.
- 2023-01-07 09:20:03下载
- 积分:1
-
city housing provident fund management center, a good database! Provide for your...
某市住房公积金管理中心系统,很好的数据库!提供给大家参考!-city housing provident fund management center, a good database! Provide for your reference!
- 2022-02-04 02:57:52下载
- 积分:1
-
altera fpga bbi cable
altera fpga bbi cable
- 2022-03-12 18:08:20下载
- 积分:1
-
Find prime numbers prepared by screening the function: void sieve (bool isPrime...
编写筛选查找素数函数:
void sieve(bool isPrime[], int n)
其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数,
所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。
然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。
对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
- 2023-03-02 04:45:03下载
- 积分:1
-
《极品列车时刻表》
《极品列车时刻表》- Need for Train Timetable
- 2023-08-08 12:25:02下载
- 积分:1