-
经典的起泡排序代码，可以显示每一步的过程
经典的起泡排序代码，可以显示每一步的过程-classic bubble sort code can demonstrate that the process every step
- 2022-06-29 17:32:01下载
- 积分：1
-
c语言写的台球程序
c语言写的台球程序-written procedures billiards
- 2022-12-15 23:30:03下载
- 积分：1
-
电气新国标 多下载 0.4KV~40.5KV户内高压开关柜
电气新国标 多下载 0.4KV~40.5KV户内高压开关柜-Electric new multi-GB downloads 0.4KV ~ 40.5KV indoor High-voltage Switch Cabinet
- 2022-02-21 06:49:37下载
- 积分：1
-
As the source code name, this code is writing in Verilog and also inside the fol...
As the source code name, this code is writing in Verilog and also inside the folder there is a c code to see the simulation results from verilog.
- 2022-03-25 06:31:05下载
- 积分：1
-
C++程序设计课本源码,供学习计算机的大学生们参考
C++程序设计课本源码,供学习计算机的大学生们参考-C source program design textbooks for students learning computer as a reference
- 2022-01-21 03:42:17下载
- 积分：1
-
很好用的文件系统 可以在dos中实现
也就是在模拟DOS
很好用的文件系统 可以在dos中实现
也就是在模拟DOS-good use of the file system can achieve dos is in a simulated DOS
- 2022-05-17 13:13:49下载
- 积分：1
-
大家如果用的着的话，可以下下来看一看啊，
大家如果用的着的话，可以下下来看一看啊，-If used in the U.S., you can take a look at the next down, ah,
- 2022-01-25 22:46:00下载
- 积分：1
-
image of Leonardo fibonacchi
image of Leonardo fibonacchi
- 2022-01-29 01:48:15下载
- 积分：1
-
计算机系统结构的一些幻灯片,适合学生参考
计算机系统结构的一些幻灯片,适合学生参考-Computer system structure of slides, suitable for students
- 2022-08-15 14:48:30下载
- 积分：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
