FizzBuzz/AWK: Difference between revisions

From Rosetta Code
Content added Content deleted
mNo edit summary
m (Fixed syntax highlighting.)
 
(8 intermediate revisions by one other user not shown)
Line 1: Line 1:
{{collection|FizzBuzz}}
{{collection|FizzBuzz}}


==regular if / else==
===regular if / else===
<!-- http://ideone.com/UrHdvd -->
<!-- http://ideone.com/UrHdvd -->
This is the "traditional" approach:
This is the "traditional" approach:
Line 7: Line 7:
Minor tweak: printf with no newline, and linebreaks only after each "FizzBuzz",
Minor tweak: printf with no newline, and linebreaks only after each "FizzBuzz",
to get a more compact output.
to get a more compact output.
<lang AWK># usage: awk -v n=38 -f FizzBuzz.awk
<syntaxhighlight lang="awk"># usage: awk -v n=38 -f FizzBuzz.awk
#
#
BEGIN {
BEGIN {
Line 24: Line 24:


print "\n# Done."
print "\n# Done."
}</lang>
}</syntaxhighlight>
{{out}}
{{out}}
<pre>
<pre>
Line 39: Line 39:
When the output is presented like that, it is easy to see a pattern.
When the output is presented like that, it is easy to see a pattern.


==bash with echo==
===bash with echo===
<!-- http://ideone.com/0VMIuO -->
<!-- http://ideone.com/0VMIuO -->
Using echo from the shell to generate the numbers as input.
Using echo from the shell to generate the numbers as input.
Line 46: Line 46:


Disadvantage: this needs a shell where echo can do this.
Disadvantage: this needs a shell where echo can do this.
<lang AWK>echo {1..100} | awk '
<syntaxhighlight lang="awk">echo {1..100} | awk '
BEGIN {RS=" "}
BEGIN {RS=" "}
$1 % 15 == 0 {print "FizzBuzz"; next}
$1 % 15 == 0 {print "FizzBuzz"; next}
Line 52: Line 52:
$1 % 3 == 0 {printf "Fizz "; next}
$1 % 3 == 0 {printf "Fizz "; next}
{printf "%3d ",$1}
{printf "%3d ",$1}
'</lang>
'</syntaxhighlight>


==One-liner with seq==
===One-liner with seq===


Like version 2, using bash with seq to generate the numbers as input. <br>
Like version 2, using bash with seq to generate the numbers as input. <br>
Line 60: Line 60:
(Also, hard to read)
(Also, hard to read)


<lang AWK>seq 100 | awk '$0=NR%15?NR%5?NR%3?$0:"Fizz":"Buzz":"FizzBuzz"'</lang>
<syntaxhighlight lang="awk">seq 100 | awk '$0=NR%15?NR%5?NR%3?$0:"Fizz":"Buzz":"FizzBuzz"'</syntaxhighlight>


==No divisions, using counters==
===No divisions, using counters===
<!-- http://ideone.com/uHmYUr -->
<!-- http://ideone.com/uHmYUr -->
Division is one of the more expensive operations,
Division is one of the more expensive operations,
Line 69: Line 69:
All processing is done inside awk, using no division & no modulo. <br>
All processing is done inside awk, using no division & no modulo. <br>
Instead, a simple counter for each of the output-variants is used:
Instead, a simple counter for each of the output-variants is used:
<lang AWK># usage: awk -v n=38 -f fizzbuzzNoDiv.awk
<syntaxhighlight lang="awk"># usage: awk -v n=38 -f fizzbuzzNoDiv.awk
#
#
# FizzBuzz using no division & no modulo-operations:
# FizzBuzz using no division & no modulo-operations:
Line 83: Line 83:
}
}
print "\n# Done."
print "\n# Done."
}</lang>
}</syntaxhighlight>
Same output as version 1.
Same output as version 1.


==No divisions, using pattern-string==
===No divisions, using pattern-string===
<!-- http://ideone.com/HJsrvl -->
<!-- http://ideone.com/HJsrvl -->
Another solution that works without division / modulo.
Another solution that works without division / modulo.
{{works with|gawk|4.1.0}} {{works with|mawk|1.3.3}}

This is inspired by the versions "Without Modulus" of Nimrod and Python, <br>
This is inspired by the versions "Without Modulus" of Nimrod and Python, <br>
using a precomputed (observed:) pattern to decide how to print each number. <br>
using a precomputed (observed:) pattern to decide how to print each number. <br>
But here, the pattern is represented as chars in a string,
But here, the pattern is represented as chars in a string,
instead of bits in an integer.
instead of bits in an integer.
<lang AWK># usage: awk -v n=42 -f fizzbuzzRepeatPattern.awk
<syntaxhighlight lang="awk"># usage: awk -v n=42 -f fizzbuzzRepeatPattern.awk
#
#
function prt(x,v) {
function prt(x,v) {
Line 110: Line 110:
i++; sel++;
i++; sel++;
prt(i, substr(pattern,sel,1) ); # select variant to use from the pattern
prt(i, substr(pattern,sel,1) ); # select variant to use from the pattern
if( sel>length(pattern) ) sel=1;
if( sel>=length(pattern) ) sel=0
}
}
print "\n# Done."
print "\n# Done."
}</lang>
}</syntaxhighlight>
Same output as version 1.
Same output as version 1.

===Custom FizzBuzz===
===Example program 1===
generated from [[General_FizzBuzz#AWK]],
for factors 2, 3, 5 using the words A, B, C. <br>
The list of numbers is also generated (much like in version 2 and 3),
and comes in as the file numbers.txt.

;Input:
<pre>31
2 A
3 B
5 C</pre>

<!-- http://ideone.com/yw1oEK -->
<syntaxhighlight lang="awk"># usage: awk -f fizzbuzzCustom.awk numbers.txt
#
BEGIN {print "# CustomFizzBuzz:"}

$1 % 2 == 0 {x = x "A"}
$1 % 3 == 0 {x = x "B"}
$1 % 5 == 0 {x = x "C"}

!x {print $1; next}
{print " ",x; x=""}

END {print "# Done."} </syntaxhighlight>

{{out}}
<pre># CustomFizzBuzz:
1
A
B
A
C
AB
7
A
B
AC
11
AB
13
A
BC
A
17
AB
19
AC
B
A
23
AB
C
A
B
A
29
ABC
31
# Done.</pre>

===Example program 2===
;Input: for the generator-program at [[General_FizzBuzz#AWK]]:
<pre>105
3 Fizz
5 Buzz
7 Baxx</pre>

<syntaxhighlight lang="awk">BEGIN {print "# CustomFizzBuzz:"}

$1 % 3 == 0 {x = x "Fizz"}
$1 % 5 == 0 {x = x "Buzz"}
$1 % 7 == 0 {x = x "Baxx"}

!x {print $1; next}
{print " ", x; x=""}
END {print "# Done."}</syntaxhighlight>

Latest revision as of 08:55, 31 August 2022

FizzBuzz/AWK is part of FizzBuzz. You may find other members of FizzBuzz at Category:FizzBuzz.

regular if / else

This is the "traditional" approach: Loop, and modulo-check to see what to print.
Minor tweak: printf with no newline, and linebreaks only after each "FizzBuzz", to get a more compact output.

# usage: awk  -v n=38  -f FizzBuzz.awk
#
BEGIN {
   if(!n) n=100
   print "# FizzBuzz:"

   for (ii=1; ii<=n; ii++)
       if (ii % 15 == 0)
           {print "FizzBuzz"}
       else if (ii % 3 == 0)
           {printf "Fizz "}
       else if (ii % 5 == 0)
           {printf "Buzz "}
       else
           {printf "%3d ", ii}

    print "\n# Done."
}
Output:
# FizzBuzz:
  1   2 Fizz   4 Buzz Fizz   7   8 Fizz Buzz  11 Fizz  13  14 FizzBuzz
 16  17 Fizz  19 Buzz Fizz  22  23 Fizz Buzz  26 Fizz  28  29 FizzBuzz
 31  32 Fizz  34 Buzz Fizz  37  38 Fizz Buzz  41 Fizz  43  44 FizzBuzz
 46  47 Fizz  49 Buzz Fizz  52  53 Fizz Buzz  56 Fizz  58  59 FizzBuzz
 61  62 Fizz  64 Buzz Fizz  67  68 Fizz Buzz  71 Fizz  73  74 FizzBuzz
 76  77 Fizz  79 Buzz Fizz  82  83 Fizz Buzz  86 Fizz  88  89 FizzBuzz
 91  92 Fizz  94 Buzz Fizz  97  98 Fizz Buzz 
# Done.

When the output is presented like that, it is easy to see a pattern.

bash with echo

Using echo from the shell to generate the numbers as input.

Advantage: we need no loop inside the script.

Disadvantage: this needs a shell where echo can do this.

echo {1..100} | awk '
BEGIN {RS=" "} 
$1 % 15 == 0 {print "FizzBuzz"; next}
$1 %  5 == 0 {printf "Buzz ";   next}
$1 %  3 == 0 {printf "Fizz ";   next}
{printf "%3d ",$1}
'

One-liner with seq

Like version 2, using bash with seq to generate the numbers as input.
Disadvantage: needs external command seq, i.e. this only works on unix. (Also, hard to read)

seq 100 | awk '$0=NR%15?NR%5?NR%3?$0:"Fizz":"Buzz":"FizzBuzz"'

No divisions, using counters

Division is one of the more expensive operations, so it is nice if we can avoid it.

All processing is done inside awk, using no division & no modulo.
Instead, a simple counter for each of the output-variants is used:

# usage: awk -v n=38  -f fizzbuzzNoDiv.awk
#
# FizzBuzz using no division & no modulo-operations:
BEGIN {
    if(!n) n=100
    print "# FizzBuzz:"
    while (c1<n) {
	  c1++; c3++; c5++; cF++; x=sprintf("%3d ",c1)
	  if(c3>= 3) { c3=0; x="Fizz " }
          if(c5>= 5) { c5=0; x="Buzz " }
	  if(cF>=15) { cF=0; x="FizzBuzz\n" }
	  printf(x)
    }
    print "\n# Done."
}

Same output as version 1.

No divisions, using pattern-string

Another solution that works without division / modulo.

Works with: gawk version 4.1.0
Works with: mawk version 1.3.3

This is inspired by the versions "Without Modulus" of Nimrod and Python,
using a precomputed (observed:) pattern to decide how to print each number.
But here, the pattern is represented as chars in a string, instead of bits in an integer.

# usage: awk  -v n=42  -f fizzbuzzRepeatPattern.awk
#
function prt(x,v) {
    if(v==0) {printf("%3d ",x); return}		# print number
    printf fb[v]				# else: print text
}
BEGIN {
    if(!n) n=100
    print "# FizzBuzz:"

    pattern="003053003503006"			# 0: print number, 3: print Fizz, etc.
    split("1,2, Fizz,4, Buzz, FizzBuzz\n,", fb, ",")

    while (i<n) {
	  i++; sel++;  
	  prt(i, substr(pattern,sel,1) ); 	# select variant to use from the pattern
          if( sel>=length(pattern) ) sel=0
    }
    print "\n# Done."
}

Same output as version 1.

Custom FizzBuzz

Example program 1

generated from General_FizzBuzz#AWK, for factors 2, 3, 5 using the words A, B, C.
The list of numbers is also generated (much like in version 2 and 3), and comes in as the file numbers.txt.

Input
31
2 A
3 B
5 C
# usage: awk  -f fizzbuzzCustom.awk  numbers.txt
#
BEGIN {print "# CustomFizzBuzz:"}

$1 %  2 == 0 {x = x "A"}
$1 %  3 == 0 {x = x "B"}
$1 %  5 == 0 {x = x "C"}

!x    {print $1; next}
      {print " ",x; x=""}

END   {print "# Done."}
Output:
# CustomFizzBuzz:
1
  A
  B
  A
  C
  AB
7
  A
  B
  AC
11
  AB
13
  A
  BC
  A
17
  AB
19
  AC
  B
  A
23
  AB
  C
  A
  B
  A
29
  ABC
31
# Done.

Example program 2

Input
for the generator-program at General_FizzBuzz#AWK:
105
3 Fizz
5 Buzz
7 Baxx
BEGIN {print "# CustomFizzBuzz:"} 

$1 %  3 == 0 {x = x "Fizz"}
$1 %  5 == 0 {x = x "Buzz"}
$1 %  7 == 0 {x = x "Baxx"}

!x  {print $1; next}
    {print " ", x; x=""}
 
END {print "# Done."}