Fibonacci sequence: Difference between revisions

Content deleted Content added
→‎{{header|F_Sharp|F#}}: comment on naive recursive sequence approach...
added L++
Line 3,046:
output (fib :n-1 :b :a+:b)
end</lang>
 
=={{header|L++}}==
<lang lpp>(defn int fib (int n) (return (? (< n 2) n (+ (fib (- n 1)) (fib (- n 2))))))
(main (prn (fib 30)))</lang>
 
=={{header|Lua}}==