algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2026-03-13 10:02:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Time_Complexity.md

Browse Source 
Modify isPrime function
This commit is contained in:
Liquor
2024-06-22 12:00:59 +08:00
committed by GitHub
parent 3200de1f73
commit b878af0ccf
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
website/content/ChapterOne/Time_Complexity.md
View File

@@ -44,6 +44,7 @@ void hello (int n){
```c ```c
bool isPrime (int n){ bool isPrime (int n){
if (num <= 1) return false;
for( int x = 2 ; x * x <= n ; x ++ ) for( int x = 2 ; x * x <= n ; x ++ )
if( n % x == 0 ) if( n % x == 0 )
return false; return false;