__ __ __ __ _____ _ _ _____ _ _ _ | \/ | \ \ / / | __ \ (_) | | / ____| | | | | | \ / |_ __\ V / | |__) | __ ___ ____ _| |_ ___ | (___ | |__ ___| | | | |\/| | '__|> < | ___/ '__| \ \ / / _` | __/ _ \ \___ \| '_ \ / _ \ | | | | | | |_ / . \ | | | | | |\ V / (_| | || __/ ____) | | | | __/ | | |_| |_|_(_)_/ \_\ |_| |_| |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1 if you need WebShell for Seo everyday contact me on Telegram Telegram Address : @jackleetFor_More_Tools:
#!/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]
}
| Name | Type | Size | Permission | Actions |
|---|---|---|---|---|
| ct_length.awk | File | 472 B | 0755 |
|
| decl.awk | File | 3.19 KB | 0755 |
|
| deps.awk | File | 1.82 KB | 0755 |
|
| eatc.awk | File | 635 B | 0755 |
|
| gdecl.awk | File | 2.88 KB | 0755 |
|
| hcal | File | 13.97 KB | 0755 |
|
| hical | File | 2.89 KB | 0755 |
|
| nocomment.awk | File | 654 B | 0755 |
|
| primes.awk | File | 1.03 KB | 0755 |
|
| qsort.awk | File | 1.11 KB | 0755 |
|