tursom/prime_numbers_c
1
0
Fork 0
mirror of https://github.com/tursom/prime_numbers_c.git synced 2024-10-22 20:10:30 +08:00
Code Issues Projects Releases Wiki Activity

修复bug

Browse Source
This commit is contained in:
tursom 2018-02-16 14:21:46 +08:00
parent 2784df786c
commit 439deb8744
1 changed files with 2 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
main.c
View File

@ -1,6 +1,6 @@
/*
* 计算某个值一下的所有质数的程序
* 时间复杂度为 O(n*ln(n))
* 时间复杂度为 Θ(n*√(n/ln(n)))
*/
#include <stdio.h>
@ -155,9 +155,6 @@ int main(int argc, char *argv[]) {
for (int i = 0; i < numbers; i++)
printf("%u\n", buff[i]);
printf("%u numbers\n", numbers);
//释放内存
free(buff)
return 0;
}
}