Fizz buzz

Fizz buzz is a group word game for children to teach them about division. Players take turns to count incrementally, replacing any number divisible by three with the word fizz, and any number divisible by five with the word buzz. — Wikipedia

Fizz buzz is fun for programmers as well as children, and has been implemented in a host of languages. Here is a simple solution in Python for the first hundred numbers.

for i in range(1, 101):
if i%3 == 0 and i%5 == 0:
my_list.append("fizzbuzz")
elif i%3 == 0:
my_list.append("fizz")
elif i%5 == 0:
my_list.append("buzz")
else:
my_list.append(i)

Since it constructs its results as an array, it could claim to be an array solution. But it employs a for-loop and an if/then/else construct. We can usually dispense with them in q.

q)show x:1+til 20
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

We are interested in whether they are divisible by 3 and 5. Those divisible by 3 have 0 as the result of x mod 3. Similarly by 5. Test both.

q)0=x mod/:3 5
00100100100100100100b
00001000010000100001b

But we need four results, not two: divisible by neither; by 3; by 5; and by both.

q)1 2*0=x mod/:3 5
0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0
0 0 0 0 2 0 0 0 0 2 0 0 0 0 2 0 0 0 0 2
q)sum 1 2*0=x mod/:3 5
0 0 1 0 2 1 0 0 1 2 0 1 0 0 3 0 0 1 0 2

The items of x are mapped to 0 1 2 3.

Let’s construct our result as a symbol vector.

q)$string x 1234567891011121314151617181920 q)($string x;20#fizz;20#buzz;20#fizzbuzz)
1        2        3        4        5        6        7        8        9    ..
fizz     fizz     fizz     fizz     fizz     fizz     fizz     fizz     fizz ..
buzz     buzz     buzz     buzz     buzz     buzz     buzz     buzz     buzz ..
fizzbuzz fizzbuzz fizzbuzz fizzbuzz fizzbuzz fizzbuzz fizzbuzz fizzbuzz fizzb..

We just need a way to use 0 1 2 3 to pick from these four vectors. Enter the Case iterator.

q)(sum 1 2*0=x mod/:3 5)'[$string x;20#fizz;20#buzz;20#fizzbuzz] 12fizz4buzzfizz78fizzbuzz11fizz1314fizzbuzz1617fizz19buzz Scalar extension means we can use atoms as the last three arguments. q)(sum 1 2*0=x mod/:3 5)'[$string x;fizz;buzz;fizzbuzz]
12fizz4buzzfizz78fizzbuzz11fizz1314fizzbuzz1617fizz19buzz

This is a good example of ‘array thinking’.

— What is the problem? I can write for-loops in my sleep.
We want you to wake up.

Notice how much of the expression simply states the problem.

[\$string x;fizz;buzz;`fizzbuzz] lists the four possible result options.

0=x mod/:3 5 tests for divisibility by 3 and 5.

(sum 1 2* .. )'[ .. ] relates the test results to the final results. This is the only ‘programmery’ bit. The other two parts correspond directly to the posed problem.

In this way the solution exhibits high semantic density: most terms in the code correspond to terms in the problem domain.

On semantic density:

“Three Principles of Code Clarity”, Vector 18:4
“Pair programming With The Users, Vector 22:1