An algorithm is needed to find the repeated integer in a vector of n distinct integers between 1 and n, except for one integer that is repeated. The pseudocode should efficiently return the integer that appears twice. The running time of the algorithm should be analyzed using asymptotic notation.