Gecko [ v99win.today ]

Name	Size	Permission
ct_length.awk	407 B	-rwxr-xr-x
decl.awk	2.97 KB	-rwxr-xr-x
deps.awk	1.28 KB	-rwxr-xr-x
eatc.awk	492 B	-rwxr-xr-x
gdecl.awk	2.73 KB	-rwxr-xr-x
hcal	13.72 KB	-rwxr-xr-x
hical	2.89 KB	-rwxr-xr-x
nocomment.awk	590 B	-rwxr-xr-x
primes.awk	1.03 KB	-rwxr-xr-x
qsort.awk	1.07 KB	-rwxr-xr-x

Code Editor : primes.awk

#!/usr/bin/mawk -f

# primes.awk
#
#  mawk -f primes.awk  [START]  STOP
# find all primes    between 2 and STOP
#       or START and STOP
#

function usage()
{ ustr = sprintf("usage: %s  [start] stop", ARGV[0])
  system( "echo " ustr) 
  exit 1
}

BEGIN { if (ARGC == 1 || ARGC > 3 ) usage()
        if ( ARGC == 2 )  { start = 2  ; stop = ARGV[1]+0 }
	else
	if ( ARGC == 3 )  { start = ARGV[1]+0 ; stop = ARGV[2]+0 }

if ( start < 2 ) start = 2
   if ( stop < start ) stop = start

prime[ p_cnt = 1 ] =  3  # keep primes in prime[]

# keep track of integer part of square root by adding
# odd integers 
   odd = test = 5
   root = 2
   squares = 9

while ( test <= stop )
{
   if ( test >= squares )
   { root++
     odd += 2
     squares += odd 
   }

flag = 1
   for ( i = 1 ; prime[i] <= root ; i++ )
   	if ( test % prime[i] == 0 )  #  not prime
	{ flag = 0 ; break }

if ( flag )  prime[ ++p_cnt ] = test

test += 2
}

prime[0] = 2

for( i = 0 ; prime[i] < start ; i++)  ;

for (  ;  i <= p_cnt ; i++ )  print prime[i]

}

${this.title}

Code Editor : primes.awk