[LRUG] Puzzle

[Andrew Stewart]

On 11 Feb 2011, at 06:51, Matthew Rudy Jacobs wrote:
> we define an ordering on these
> 
> [u1,n1], [u2,n2], [u3,n3], [u4,n4], [u5,n5], [u6,n6], [u7,n1], [u8,n2], [u9,n3]
> [u1,n2],[u2,n3], ...                      [u5,n6], [u6,n1], ...                     [u9,n4]
> [u1,n3],....
> 
> namely we cycle over [u(i), n(i)]
> when we run out of ns with start n from the beginning
> 
> then we shift the index on the ns
> [u(i), n(i+1)]

And then we convert each page into an offset, and pull out the tuple at that index?

I like it.

Thanks!

Andy
------
http://airbladesofware.com