Find Prime number

	Start Algorithm
	Store 0 in half, no, ctr;
	Display ("Enter number:")
	Read no
		ctr = 2
		half = no / 2
    while ctr <= half
      if no % ctr = 0
          fi = 1
	   end of if
	
	if fi = 1
	   Display "Number is not prime"
	else
	   Display "Number is prime"
	end of if
	
	Stop algorithm