ant to find a particular entry by the key. Looking up through all the entries will take you exactly 18,446,744,073,709,551,615 steps. Even if a single step is 1 nanosecond long, the whole operation takes 584 years.
	</p>
	<p>
But let's say you can split the whole array in two and for each half, say does the queried entry belong to that half or not. How many steps will it require to find an entry then?
	</p>
	<p>
Yes, only this many.
	</p>
	<p>
Ok, let's be more specific. Let's say you have an array of 640 n