Fibonacci Project Participants
David Allen - Yr. So, Maj. CS
Lang/platform - Turbo, VMS Fortran
Algorithm - Original turbo & Current / fastest algorithm
- Synthetic Addition
- Latest WWW HTML for Fib Project
Chris Blotzke - Yr. Fr, Maj. CS
Lang/platform - Turbo, VMS Fortran
Algorithm - Original turbo & Current / fastest algorithm
- Graphical Addition
Owen Keefer - Yr. Grad, Maj. MS CS
Lang/platform - Turbo, VMS Fortran, BASIC
Algorithm - Original turbo & Current / fastest algorithm
- Synthetic Addition
- Original VMS Fortran code
- Original BASIC code (just cause we wanted to)
Andy Grimberg - Yr. Fr, Maj. CE
Lang/platform - Turbo, BASIC, HTML (for WWW Page)
Algorithm - Original turbo
- Sythetic Addition
- Original WWW HTML for Fib Project
- Original BASIC code (just cause we wanted to)
Documentation
Andy Nierman - Yr. Jun, Maj. CS
Lang/platform - Symantec C++?
Algorithm - ??
Joseph Anderson - Yr. So, Maj. CS
Lang/platform - Turbo, MASM
Algorithm - Synthetic Addition in Asm
Research - _Fibonacci_Quarterly_ found in the library
Ken Perrine - Yr. Fr, Maj. CE
Lang/platform - Symantec C++ with Asm
Algorithm - Synthetic Addition in Asm
Matthew Anderson - Yr. So, Maj. EE
Lang/platform - Turbo
Algorithm - Logarithmic Algorithm Theory
Rocky Downs - Yr. So, Maj. Math
Lang/platform - VMS Pascal
Algorithm - Multiplicative Fibonacci sequence
Currently the VMS Fortran code is the fastest and has produced the
largest number as far as we know.
We are now attempting to get Turbo Pascal to generate the millionth
iteration.
Current work is still going on using assembler for speed.
Maintained By: David P. Allen (AllenDP@PLU.edu).
Last Update: 1-26-96