Question

I’ve been tasked with writing a function that generates a table given n operators. The truth table must be in a list and each row of the table must be in separate lists (inside the main list).

I know the solution involves recursion but I just can’t seem to think it through.

Can someone help me out? This is only a small part of the assignment.

Answer 1

Easiest way I can think of off the top of my head is to simply convert 2^n to binary and count down, then convert the output to a list.

ie for n=3:

Truth table:

a b c
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

2^3 = 8, 8 in binary = 1000, start from 1000-1 = 111 and work your way down to 0, record outputs, and voila!