On Thu, Apr 21, 2022 at 02:11:03AM +0000, Alain De Vos via Digitalmars-d-learn
wrote:
> Following java program creates an infinite fibonacci sequence (stream)
> an takes the first 42 values of it.
[...]
> How would this program look converted to dlang ?
> Maybe there are multiple solutions ?
Code:
-------
void main() {
import std;
writeln(recurrence!((a,n) => a[n-1] + a[n-2])(1, 1).take(42));
}
-------
Output:
-------
[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584,
4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229,
832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817,
39088169, 63245986, 102334155, 165580141, 267914296]
-------
T
--
"Computer Science is no more about computers than astronomy is about
telescopes." -- E.W. Dijkstra
