Download code

From LiteratePrograms

Back to Fibonacci_numbers_(Oz)

Download for Windows: single file, zip

Download for UNIX: single file, zip, tar.gz, tar.bz2

Fib.oz

 % Copyright (c) 2008 the authors listed at the following URL, and/or
 % the authors of referenced articles or incorporated external code:
 % http://en.literateprograms.org/Fibonacci_numbers_(Oz)?action=history&offset=20080201070240
 % 
 % Permission is hereby granted, free of charge, to any person obtaining
 % a copy of this software and associated documentation files (the
 % "Software"), to deal in the Software without restriction, including
 % without limitation the rights to use, copy, modify, merge, publish,
 % distribute, sublicense, and/or sell copies of the Software, and to
 % permit persons to whom the Software is furnished to do so, subject to
 % the following conditions:
 % 
 % The above copyright notice and this permission notice shall be
 % included in all copies or substantial portions of the Software.
 % 
 % THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 % EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 % MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 % IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 % CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 % TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 % SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 % 
 % Retrieved from: http://en.literateprograms.org/Fibonacci_numbers_(Oz)?oldid=12457
 
 functor
 import
    System
    Application
 define
    fun {RecursiveFib N}
       if N < 2 then N else {RecursiveFib N - 1} + {RecursiveFib N - 2} end
    end
 
    Memo = {NewDictionary}
    fun {MemoizedFib N}
       if {Dictionary.member Memo N}
       then {Dictionary.get Memo N}
       else
          FibN
       in
          if N < 2 then FibN = N else FibN = {MemoizedFib N - 1} + {MemoizedFib N - 2} end
          {Dictionary.put Memo N FibN}
          FibN
       end
    end
 
    fun {IterativeFib N}
       fun {Fib N F1 F2}
         if N < 1 then F1 else {Fib (N - 1) F2 (F1 + F2)} end
       end
    in
       {Fib N 0 1}
    end
 
    proc {RunFib F}
       for X in 0..30 do
          {System.showInfo "{" # {System.printName F} # " " # X # "} = " # {F X}}
       end
    end
 
    {RunFib RecursiveFib}
    {RunFib MemoizedFib}
    {RunFib IterativeFib}
    {Application.exit 0}
 
 end