Re: [問題] 搜尋質數
用你的code下去稍微修改
黃色為我有修改的部份
現在精神狀況不太好(好想睡) 希望沒有改錯
當然一定有更好的演算法啦XD
class TestPrime
{
// 一維陣列的應用:求質數
public static void main(String args[])
{
final int MAX = 300;// Once it is initiated it can not be changed.
// false為質數,true為非質數
// 宣告後若沒有給定初值,其預設值為false
boolean prime[] = new boolean[MAX];
prime[0] = true;
prime[1] = true;// 0 and 1 are not prime;
int count = 0;
for (int i = 2; i < MAX; i++)
{
prime[i] = false;
for (int a = 2; a*a <= i; a++)
{
if (i % a == 0)
{
prime[i] = true;
break;
}
}
}
for (int i = 2; i < MAX; i++)
{
if (prime[i] == false)
{
count++;
System.out.println(i);
}
}
System.out.println("the number of prime is " + count);
}
}
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.135.51.171
※ 編輯: peacedove 來自: 220.135.51.171 (07/03 03:37)
※ 編輯: peacedove 來自: 220.135.51.171 (07/03 11:22)
→
07/03 22:00, , 1F
07/03 22:00, 1F
推
07/03 22:02, , 2F
07/03 22:02, 2F
推
07/03 23:53, , 3F
07/03 23:53, 3F
推
07/04 13:14, , 4F
07/04 13:14, 4F
推
07/04 14:41, , 5F
07/04 14:41, 5F
→
07/04 14:43, , 6F
07/04 14:43, 6F
→
07/04 14:47, , 7F
07/04 14:47, 7F
→
07/04 18:26, , 8F
07/04 18:26, 8F
→
07/04 18:29, , 9F
07/04 18:29, 9F
→
07/05 03:22, , 10F
07/05 03:22, 10F
推
07/06 14:59, , 11F
07/06 14:59, 11F
→
07/06 15:01, , 12F
07/06 15:01, 12F
→
07/06 15:17, , 13F
07/06 15:17, 13F
→
07/06 15:19, , 14F
07/06 15:19, 14F
討論串 (同標題文章)