Fibonacci sequence: Difference between revisions

Content added Content deleted
(Add MAD)
m (→‎{{header|PL/SQL}}: Simplified the code (using CASE statement) and added error handling.)
Line 8,471: Line 8,471:


=={{header|PL/SQL}}==
=={{header|PL/SQL}}==
<lang PL/SQL>Create or replace Function fnu_fibonnaci(p_iNumber integer)
<lang PL/SQL>create or replace function fnu_fibonacci(p_num integer) return integer is
return integer
f integer;
p integer;
is
nuFib integer;
q integer;
begin
nuP integer;
case when p_num < 0 then raise_application_error(-20001, 'Invalid input: ' || p_num, true);
nuQ integer;
when p_num in (0, 1) then f := p_num;
Begin
if p_iNumber is not null then
else
if p_iNumber=0 then
p := 0;
nuFib:=0;
q := 1;
for i in 2 .. p_num loop
Elsif p_iNumber=1 then
nuFib:=1;
f := p + q;
Else
p := q;
nuP:=0;
q := f;
nuQ:=1;
end loop;
end case;
For nuI in 2..p_iNumber loop
return(f);
nuFib:=nuP+nuQ;
end fnu_fibonacci;
nuP:=nuQ;
/</lang>
nuQ:=nuFib;
End loop;
End if;
End if;
return(nuFib);
End fnu_fibonnaci;</lang>


=={{header|Plain English}}==
=={{header|Plain English}}==