We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3200de1 commit b878af0Copy full SHA for b878af0
website/content/ChapterOne/Time_Complexity.md
@@ -44,6 +44,7 @@ void hello (int n){
44
45
```c
46
bool isPrime (int n){
47
+ if (num <= 1) return false;
48
for( int x = 2 ; x * x <= n ; x ++ )
49
if( n % x == 0 )
50
return false;
0 commit comments