Re: detecting primes - bugfix
Re: detecting primes - bugfix
- Subject: Re: detecting primes - bugfix
- From: garbanzito <email@hidden>
- Date: Fri, 23 Feb 2001 17:47:36 -0700
at 2/23/01, 9:56 AM -0800, they whom i call Doug Korns wrote:
if p is not equal to z then
It takes longer to write, but it improves the readability of the script
(more English-like) and when you share scripts, the transmittability
through the internet is not a problem.
honestly, it's harder for me to read. using symbols helps
me distinguish the wheat (identifiers) from the chaff
(operators). English-like and readable aren't synonymous
for me, because i read the symbol like an ideograph for the
concept. i do tend to be wordy with my identifiers, though,
so my lines might be even longer:
if a_possible_prime != next_divisor then
(used the Frontier version of not equals to avoid list munge.)
steve harley email@hidden