程序使用嵌套的for循环找出2〜100中的素数

#import <Foundation/Foundation.h>
 
int main ()
{
   /* local variable definition */
   int i, j;
   
   for(i=2; i<100; i++) {
      for(j=2; j <= (i/j); j++)
        if(!(i%j)) break; // if factor found, not prime
      if(j > (i/j)) NSLog(@"%d is prime\n", i);
   }
 
   return 0;
}