![]() STEP 4: If num is divisible by loop iterator, then increment temp. STEP 3: Iterate a “for” loop from 2 to num/2. (n - 1) ! ≡ (n-1) mod n C Program for Prime Numbers Using For Loop Algorithm to Find Prime Number
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |