Anonymous-recursion is recursion which does not explicitly call a function by name. This is usually done by calling the current function from within itself or by passing the current function as a callback to an other (named) function. Use this tag for questions directly related to this type of recursion only.
Questions tagged [anonymous-recursion]
18 questions
0
votes
3 answers
is it possible to create an anonymous recursive function in racket
If I have a recursive function like this:
(define (double-n-times x n)
(if (= n 0)
x
(double-n-times (* 2 x) (- n 1))))
How can I make a lambda version of it and never give it a name? ... like if i want to inline it somewhere. Is…
Alex028502
- 3,486
- 2
- 23
- 50
0
votes
1 answer
How to create a big array of Func's representing a Vandermonde system in C#?
I am trying to create a big Vandermonde array of Func's. I can create a 4x3 system like this:
Func[] vandermondeSystem =
{
x => x[0]*Math.Pow(1, 0) + x[1]*Math.Pow(1, 1) + x[2]*Math.Pow(1, 2),
x => x[0]*Math.Pow(2, 0) +…
Ferit
- 8,692
- 8
- 34
- 59
0
votes
2 answers
Recursion function failed in CodeIgniter
I am using a recursion function to convert my menus in a tree. The array I got from the database is:
array (
[0] => stdClass Object (
[nav_group_id] => 1
[entity_id] => 1
[parent] => 0
[name] => Meter Reading
[link] => #…
user1431803