Thread:Mathmagician/@comment-3562424-20121121052230/@comment-4674838-20121123061105

Frankly, there is no simple example. Logarithmic time bounds come into the picture when you have code that involves Recursion. Typically you would analyze the algorithm and set up the recurrence relation and do a huge amount of math to prove the O(NlogN) time. It's about a hundred times more difficult and lengthy than the example I posted above.