Knuth's power tree: Difference between revisions
Content added Content deleted
m (rosetta uses overflow: hidden so give full long line) |
m (Describe data structure) |
||
| Line 79: | Line 79: | ||
This task is a bit verbose... |
This task is a bit verbose... |
||
We can represent the tree as a list of indices. Each entry in the list gives the value of n for the index a+n. (We can find a using subtraction.) |
|||
<lang J>kpt=:3 :0 |
<lang J>kpt=:3 :0 |
||