After not having blogged for such a long time, I think I'll resume my activity with a conundrum... :-)

I have been reading a book on the Riemann Hypothesis and a paragraph in the book reminded me of a coding problem a friend once told me about.

You have an array of 99 positions and you fill it with integers from 1 to 100 without repetition and unordered. Obviously, one of the numbers in that interval is missing from the array.

So, what's the smallest order algorithm that finds the