Re: Learning recursion with hailstone seqence
- From: Andreas Koch <nospam@xxxxxxxxxxxxxxx>
- Date: Thu, 16 Nov 2006 23:05:11 +0100
DAVID B MORGAN wrote:
I'm playing with the hailstone sequence. My function will
need to iterate millions of times to process the data. I have two questions:
1. Can this function be optimised ? (approx 2^67 iterations are neccessary on current dataset)
Forget it.
Think about how many INSTRUCTIONS a modern computer can do per second,
and then think how long your function would take even it it
only consisted of one instruction (and it doesn't).
2. How can I test huge numbers (like 2^1000) --- Int64 can't handle itThere are components out there for handling huge numbers.
For calculating with them, but forget iterating them.
.
- References:
- Learning recursion with hailstone seqence
- From: DAVID B MORGAN
- Learning recursion with hailstone seqence
- Prev by Date: Learning recursion with hailstone seqence
- Next by Date: Re: Out of system resources
- Previous by thread: Learning recursion with hailstone seqence
- Next by thread: Re: Learning recursion with hailstone seqence
- Index(es):
Relevant Pages
|
