All Questions
1
question
1
vote
1
answer
89
views
Generating function of recursive algorithm with random subcalls
I was presented with the following algorithm. As input the algorithm gets an array of length $n \geq 0$. If $n \geq 2$ then for each $k \in \{1, 2, ..., n\}$ the algorithm calls itself recursively ...