search for: fibonnacci

...tack is > > strictly linear. Pushes are followed by pops. But I don't think this > > is the most interesting case for recursion in real programs. I see > > (qualitatively, poorly) 3 reasons for recursion in code that should > > go fast: > > > > > > 1. A fibonnacci function in a microbenchmark or compiler shootout. I > > think we can safely ignore this usecase... > > 2. Divide and conquer algorithms. Quicksort, FFT butterflies, etc. > > 3. Traversing a data structure, where the recursion is simply to get > > to the leaves which is wher...

...hts. The above transform works because the access pattern to the stack is strictly linear. Pushes are followed by pops. But I don't think this is the most interesting case for recursion in real programs. I see (qualitatively, poorly) 3 reasons for recursion in code that should go fast: 1. A fibonnacci function in a microbenchmark or compiler shootout. I think we can safely ignore this usecase... 2. Divide and conquer algorithms. Quicksort, FFT butterflies, etc. 3. Traversing a data structure, where the recursion is simply to get to the leaves which is where all the fun stuff happens. Points...

I'm not sure if this is a known peculiarity or a bug, but I stumbled across what I think is very odd behavior from delayedAssign. In the below example x switches values the first two times it is evaluated. > delayedAssign("x", {x <- 2; x+3}) > x==x [1] FALSE > delayedAssign("x", {x <- 2; x+3}) > x [1] 5 > x [1] 2 The ?delayedAssign documentation says

...tack is > > strictly linear. Pushes are followed by pops. But I don't think this > > is the most interesting case for recursion in real programs. I see > > (qualitatively, poorly) 3 reasons for recursion in code that should > > go fast: > > > > > > 1. A fibonnacci function in a microbenchmark or compiler shootout. > > I > > think we can safely ignore this usecase... > > 2. Divide and conquer algorithms. Quicksort, FFT butterflies, etc. > > 3. Traversing a data structure, where the recursion is simply to get > > to the leaves whi...