Subj : Re: puzzle
To   : comp.programming
From : Willem
Date : Sun Jul 10 2005 06:37 pm

Joe wrote:
) To make things interesting, this problem should be reposed as,
) you have a unordered sequence of the numbers 0 to n with one
) number missing and the others appearing only once.  Find two
) O(n) ways of determining the missing number.

O(n) time and how much memory ?  O(1) ?  O(n) ?


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

.