Download code
From LiteratePrograms
Back to Fibonacci_numbers_(Icon)
Download for Windows: single file, zip
Download for UNIX: single file, zip, tar.gz, tar.bz2
fib.i
1 # Copyright (c) 2008 the authors listed at the following URL, and/or 2 # the authors of referenced articles or incorporated external code: 3 # http://en.literateprograms.org/Fibonacci_numbers_(Icon)?action=history&offset=20081030211610 4 # 5 # Permission is hereby granted, free of charge, to any person obtaining 6 # a copy of this software and associated documentation files (the 7 # "Software"), to deal in the Software without restriction, including 8 # without limitation the rights to use, copy, modify, merge, publish, 9 # distribute, sublicense, and/or sell copies of the Software, and to 10 # permit persons to whom the Software is furnished to do so, subject to 11 # the following conditions: 12 # 13 # The above copyright notice and this permission notice shall be 14 # included in all copies or substantial portions of the Software. 15 # 16 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 17 # EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 18 # MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 19 # IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 20 # CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 21 # TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 22 # SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 23 # 24 # Retrieved from: http://en.literateprograms.org/Fibonacci_numbers_(Icon)?oldid=15372 25 26 27 procedure fib(n) 28 if n<2 then return n 29 else return fib(n-1)+fib(n-2) 30 end 31 32 33 34 35 36 procedure fastfib(n) 37 local prevfib, currfib, nfib 38 nfib:=2 39 prevfib:=1 40 currfib:=1 41 while nfib<n do { 42 prevfib:=:currfib 43 currfib+:=prevfib 44 nfib+:=1 45 } 46 return currfib 47 end 48 49 50 procedure main() 51 local n 52 53 n:=1 54 while n<30 do { 55 write(fib(n)) 56 n+:=1 57 } 58 59 n:=1 60 while n<30 do { 61 write(fastfib(n)) 62 n+:=1 63 } 64 end 65 66 67
