Algoritma Tes Prima

Posted: 28 Maret 2014 in Strategi Algoritma

Program Tesprima

{ membaca bilangan bulat n, menampilkan true jika n primadan sebaliknya false }

Deklarasi

f,n,i : integer

Deskripsi

f <– 1   

read(n)

for i <– 2 to n do

—if(n mod i=0)

——f <– f+1

—if (f=2)

——return true

—else

——return false

 

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s