Anonymous user
Anonymous recursion: Difference between revisions
→{{header|PL/I}}
m (fix mismatched _incorrect_ tags) |
|||
Line 123:
=={{header|PL/I}}==
{{incorrect|PL/I|This defines a helper function 'fib', while the puprose of this task is to avoid exactly that.
The description says "if possible". In any case, the Ada solution uses a helper function, which has not been designated as "wrong",
so it lookwd that that was how to proceed with the solution.}}
<lang PL/I>
(fixedoverflow, size):
Line 136 ⟶ 138:
declare N fixed binary (31);
if N <= 2 then return (N);
return (fib(N-1) + fib(N-2));
end fib;
| |||