Grabbing frogs...

Order of Log N

Are you Log N?

I am. What can I do for you?

Our code is inefficient and we need your help. We want to join your Order.

Well frogs, joining the Order of Log N is not easy. You will face many challenges...

...each less difficult than the one before it!

That's a little anticlimactic.

Okay, I know this joke might be a bit difficult for non-computer science people. To achieve O(log n) time complexity, each iteration of your algorithm working with the set *n* should consider smaller and smaller subsets of *n*. For example, guessing a number between 1 and 100 when an incorrect guess gives you a hint "higher" or "lower." Start by guessing 50. To high? Guess 25. Too low? Guess 38. Each time, the range of numbers you have to consider gets smaller.

That's why the Log says that each challenge is easier than the one before it. You can laugh now. Or not. Come back Monday and maybe the jokes will be better.

That's why the Log says that each challenge is easier than the one before it. You can laugh now. Or not. Come back Monday and maybe the jokes will be better.

Published Friday, 12 August 2016

Vote for us on TopWebComics.com!

Our Current Rank is: 0