http://robowiki.net/w/index.php?title=Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!/reply_(4)&feed=atom&action=historyThread:Talk:Binary Search PIF/Great and very detailed article!/reply (4) - Revision history2024-03-29T15:00:48ZRevision history for this page on the wikiMediaWiki 1.34.1http://robowiki.net/w/index.php?title=Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!/reply_(4)&diff=53677&oldid=prevXor: Reply to Great and very detailed article!2017-11-03T23:43:54Z<p>Reply to <a href="/wiki/Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!/reply" title="Thread:Talk:Binary Search PIF/Great and very detailed article!/reply">Great and very detailed article!</a></p>
<p><b>New page</b></p><div>Well, that’s only true for large enough n... And for small n, such as our cases, constant factor is dominant. <br />
<br />
Btw, memory access is WAAAY expensive than basic calculations, so the gain for optimized memory access, for small n, often outperforms paper algorithms that don’t use contiguous memory in order.</div>Xor