Message:

<p>[QUOTE=&quot;Theodosius, post: 3436257, member: 77077&quot;]The shifting is less effort when you leave the pages half full.&nbsp; When a page fills up you split the coins across the original page and a new page.&nbsp; This is the classic b-tree algorithm used for relational database indexes.&nbsp; <img src="styles/default/xenforo/clear.png" class="mceSmilieSprite mceSmilie1" alt=":)" unselectable="on" unselectable="on" /></p><p><br /></p><p>I have five binders for my mostly junky Roman collection.&nbsp; I started with one, then I found cointalk. I have applied the splitting algorithm to a whole&nbsp; binder 4 times now.</p><p><br /></p><p>I fill the empty slots in the pages with blank flip inserts.&nbsp; It looks better to me than seeing through the page to those underneath. </p><p><br /></p><p>John[/QUOTE]</p><p><br /></p>

Your name or email address:

Do you already have an account?

• No, create an account now.
• Yes, my password is:
• Forgot your password?

Stay logged in