Fibonacci n-step number sequences: Difference between revisions
Content deleted Content added
m added whitespace before the TOC (table of contents), added a ;Task: and ;Related tasks: (bold) headers, corrected a misspelling. |
m →{{header|Sidef}}: minor code simplifications |
||
| Line 2,918: | Line 2,918: | ||
<lang ruby>func fib(n, xs=[1]) { |
<lang ruby>func fib(n, xs=[1]) { |
||
loop { |
loop { |
||
var len = xs.len |
var len = xs.len |
||
len >= 20 && break |
len >= 20 && break |
||
xs.append(xs.ft(0.max(len - n)).sum) |
xs.append(xs.ft(0.max(len - n)).sum) |
||
} |
} |
||
return xs |
return xs |
||
} |
} |
||
for i in (2..10) { |
|||
say fib(i).join(' ') |
say fib(i).join(' ') |
||
} |
} |
||
say fib(2, [2, 1]).join(' ') |
say fib(2, [2, 1]).join(' ')</lang> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||