Question: Let A be an array of size N (? 2) containing integers from 1 to N-1 (inclusive), with exactly one repeated.
Algorithm: Describe a fast algorithm (with ~N array lookups of A) for finding the integer in A that is repeated.
Can you give the algorithm ASAP?