- Forum
- General C++ Programming
- Lagged Fibonacci generator
Lagged Fibonacci generator
Someone is able to explain me in detail how works the lagged Fibonacci generator?
If j and k are very large, how it's possible that in the first few cycles you can get f (n - j) and f (n - k)?
Thanks in advance for your answers.
If j and k are very large, how it's possible that in the first few cycles you can get f (n - j) and f (n - k)?
Thanks in advance for your answers.
Topic archived. No new replies allowed.