The question:

Given an array of integers, write a function to return any duplicated 
values.  What is the the running time of this algorithm?

It seems to me that the ideal would be some sort of a hash involving a 
second array, as long in bits as there are integer numbers.  Each 
integer would set a bit.  If that bit had been previously set, bingo, a 
duplicate.

It seems to me as though the big-O for that function is 1.  Is that 
correct?

þ CMPQwk 1.42 999

--- Maximus/2 3.01