Prime numbers program

Question

I\'m currently trying out some questions just to practice my programming skills. ( Not taking it in school or anything yet, self taught ) I came across this problem which re

Answer 1

For one, you'd have less code (which is always a good thing!) if you didn't have special cases for 3, 5 and 7.

Also, you can avoid the special case for 2 if you just set num[b] = 2 and only test for divisibility by things in your array.