http://robowiki.net/w/index.php?action=history&feed=atom&title=Thread%3ATalk%3ABinary_Search_PIF%2FGreat_and_very_detailed_article%21%2Freply 2026-04-17T09:08:43Z Revision history for this page on the wiki MediaWiki 1.34.1 http://robowiki.net/w/index.php?title=Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!/reply&diff=53672&oldid=prev 2017-11-03T19:01:06Z

<p>Reply to <a href="/wiki/Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!" title="Thread:Talk:Binary Search PIF/Great and very detailed article!">Great and very detailed article!</a></p> <p><b>New page</b></p><div>Algorithmic optimisation will pretty much always outperform low level optimisation's such as optimising memory access for cache misses. <br /> <br /> You really shouldn't need to worry about cache misses in Java!<br /> <br /> Optimising from o(n) to o(log n) will give a big performance benefit!</div>

Wolfman