intprime(int number){if(number ==2){return1;}if(number ==1){return0;}for(size_t i =2; i*i <= number; i++){if(number % i ==0){return0;}}return1;}
三、 优化二
如果number是偶数(不是2),它一定是合数
所以保证i=3,i=i+2,i每次都是奇数
intprime(int number){if(number ==2){return1;}if(number ==1|| number %2==0){return0;}for(size_t i =3; i * i <= number; i = i +2){if(number % i ==0){return0;}}return1;}