3 ms·
How about a depth-first search, then?
by emodendroket 12y ago
How about a depth-first search, then?
- crimsonalucard 12y agoThat's not tail recursion! It's tree recursion.
- emodendroket 12y agoWell, good point, but so is the naive implementation of Fibonacci, isn't it?