Subj : Re: puzzle
To   : comp.programming
From : Joe Seigh
Date : Sun Jul 10 2005 02:47 pm

Willem wrote:
> 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) ?
> 
O(1)

-- 
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.

.