tail-recursion Questions
1
Solved
Since version 4.4.0, R supports tail recursion through the Tailcall function. I automatically assumed that it means an improvement for codes that use tail recursion.
However, consider the following...
Forenamed asked 12/9 at 18:17
2
Solved
Lua claims that it implement tail call properly thus no stack needs to be maintained for each call thus allow infinite recursion, I tried to write a sum function, one is not tail call, and one is t...
Effie asked 9/11, 2012 at 6:44
3
Solved
I wrote the follwing function:
let str2lst str =
let rec f s acc =
match s with
| "" -> acc
| _ -> f (s.Substring 1) (s.[0]::acc)
f str []
How can I know if the F# compiler turned it ...
Mollee asked 30/4, 2009 at 12:44
4
Solved
Does R support proper tail recursion and where can I find documentation about this?
Selfseeking asked 3/11, 2012 at 12:1
2
Solved
const isPositive = (n: number) => n > 0;
function fitsIn(dividend: number,
divisor: number,
count: number,
accum: number): number {
if (accum + divisor > dividend) {
return count;
}...
Trevar asked 18/4, 2022 at 9:9
3
Solved
C language
In the C programming language, it's easy to have tail recursion:
int foo(...) {
return foo(...);
}
Just return as is the return value of the recursive call. It is especially importa...
Mawkin asked 9/12, 2019 at 22:23
2
Solved
Before I start: YES, this is a homework from college. Before I get told that I'm lazy and evil: this part of the homework was to convert two functions we already had, this one is the 6th.
(define (...
Fossilize asked 21/3, 2011 at 8:50
5
Solved
I have been trying to understand Tail call optimization in context of JavaScript and have written the below recursive and tail-recursive methods for factorial().
Recursive:
function factorial (n)...
Sciamachy asked 14/5, 2016 at 8:36
10
Solved
How do I tell if gcc (more specifically, g++) is optimizing tail recursion in a particular function? (Because it's come up a few times: I don't want to test if gcc can optimize tail recursion in ge...
Dignadignified asked 29/1, 2009 at 2:42
6
Solved
I was playing with permutation in a couple of programs and stumbled upon this little experiment:
Permutation method 1:
permute([], []).
permute([X|Rest], L) :-
permute(Rest, L1),
select(X, L, L...
Janitress asked 10/6, 2013 at 2:42
3
The typical List.map function in OCaml is pretty simple, it takes a function and a list, and applies the function to each items of the list recursively. I now need to convert List.map into a tail r...
Guinness asked 9/12, 2014 at 18:47
8
Solved
I have the following piece of code which fails with the following error:
RuntimeError: maximum recursion depth exceeded
I attempted to rewrite this to allow for tail recursion optimization (TC...
Deliberative asked 27/11, 2012 at 19:53
2
Solved
I've recently learned Haskell, and am trying to carry the pure functional style over to my other code when possible. An important aspect of this is treating all variables as immutable, i.e. constan...
Currey asked 16/3, 2011 at 14:31
3
I couldn't find articles describing why tail recursive functions should be preferred over iterative algorithms.
I'm not asking why tail recursive is better than simple recursive which I think is c...
Popovich asked 15/10, 2012 at 9:49
4
Does the Go programming language, as of now, optimize tail calls? If not, does it at least optimize tail-recursive calls of a function to itself?
Mutual asked 24/8, 2012 at 3:5
6
In Introduction to Algorithms p169 it talks about using tail recursion for Quicksort.
The original Quicksort algorithm earlier in the chapter is (in pseudo-code)
Quicksort(A, p, r)
{
if (p < ...
Quixotic asked 30/9, 2013 at 12:27
3
Solved
I was trying to figure out hands-on how tail calls are handled by the C# compiler.
(Answer: They're not. But the 64bit JIT(s) WILL do TCE (tail call elimination). Restrictions apply.)
So I wrote a ...
Autacoid asked 27/11, 2013 at 14:58
7
Solved
I found this question about which languages optimize tail recursion. Why C# doesn't optimize tail recursion, whenever possible?
For a concrete case, why isn't this method optimized into a loop (Vi...
Fushih asked 29/1, 2009 at 12:20
8
Solved
In order to understand the advanced algorithm concepts like greedy methods and dynamic programming, one first need to be well versed in recursion.
I am relatively new to recursion. Whenever a ques...
Hermilahermina asked 12/7, 2013 at 9:6
4
Solved
Pascal's Triangle Scala: Compute elements of Pascal's triangle using tail recursive approach
In Pascal's Triangle the number at the edge of the triangle are all 1, and each number inside the triangle is the sum of the two numbers above it. A sample Pascal's triangle would look like below.
...
Emmerich asked 16/10, 2019 at 11:35
6
Solved
I have been reading articles describing how space complexity of quicksort can be reduced by using the tail recursive version but I am not able to understand how this is so. Following are the two ve...
Lumpfish asked 8/11, 2013 at 7:50
4
Solved
I have a problem in understanding the performance of a Common Lisp function (I am still a novice). I have two versions of this function, which simply computes the sum of all integers up to a given ...
Coupon asked 18/5, 2013 at 16:50
4
Solved
The implementation of Integer>>#factorial in Pharo is:
factorial
"Answer the factorial of the receiver."
self = 0 ifTrue: [^ 1].
self > 0 ifTrue: [^ self * (self - 1) factorial].
sel...
Genuine asked 7/5, 2016 at 14:33
2
As Scala developer learning the IO Monad, and therefore technicalities of Trampolining in general that are necessary for recursion where tail call optimization is not possible, I wonder how Haskell...
Pertinacious asked 22/4, 2021 at 0:56
2
Solved
I am trying to implement a tail-recursive factorial calculator but I am still getting a stack overflow. Can anyone help me out in figuring out why?
I have read that Java 8 supports Tail call optim...
Heartstrings asked 6/11, 2020 at 15:9
1 Next >
© 2022 - 2024 — McMap. All rights reserved.