|
|
|
![]() |
|
|||||||
|
||||||||
|
|
Thread Tools | Rate Thread | Display Modes |
|
#11
|
|||
|
|||
|
Re: Fibonacci Sequence
A bad computer slows it down by a linear multiplier. Say if my computer is 2.0 Ghz and your computer is 200 MHz then it would take your comp about 10 times longer to run the same program, depending on things running in the background. I doubt your computer is slower than 200 MHz, so if it takes a whole night to run, then it would still take an hour or so to run on a "fast" computer. That said, obviously if you don't calculate every term in between, you can calculate the nth term much much faster, which is why I could calculate the millionth in 29 sec instead of a few hours.
|
| Thread Tools | |
| Display Modes | Rate This Thread |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Mechanics of a 3 speed shifting sequence | sanddrag | Technical Discussion | 3 | 27-02-2005 00:34 |
| [FVG]: Opening Sequence | Joshua May | FIRST-related Organizations | 16 | 24-06-2004 00:00 |
| RC bootup sequence | Venkatesh | Programming | 17 | 18-11-2003 20:56 |
| PB_Mode Sequence | DKolberg | Programming | 3 | 17-03-2003 10:54 |
| Competition Sequence for PBasic | ttedrow | Programming | 12 | 23-01-2003 08:49 |