We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent bc15d7f commit 9906215Copy full SHA for 9906215
04.ProgrammerKaioken20.c
@@ -1,6 +1,6 @@
1
-/// You have grown SMARTER, and cut half of the run time
2
-/// by checking divisibility with odd-numbers only. You
3
-/// also understand that looping till x/2 is enough.
+/// You have grown SMARTER, and halved the run time by checking
+/// divisibility with odd-numbers only. You also understand that
+/// looping till x/2 is enough.
4
5
int prime_or_not(int x) {
6
if (x == 2) {
0 commit comments