You then have to store how many levels down the real, as opposed to index, data is. If you have looped enough to have reached an index that is small, the depth count will on average be so large that it takes about as much space as your original data.
1. Well, here's to hoping.
2. He addressed this - you store the index in pi as well. If the index of the index is too big, you can store that too... indices all the way down!
You then have to store how many levels down the real, as opposed to index, data is. If you have looped enough to have reached an index that is small, the depth count will on average be so large that it takes about as much space as your original data.
1. If everyone uses this algorithm maybe we'll find out if pi is normal or not!
2. Shhh don't let the pie hear you.
1. Well, that would be a hard bug to reproduce right?
"Saving this file (attached) takes an infinite amount of time."