Subj : Re: puzzle
To   : comp.programming
From : pete
Date : Mon Jul 11 2005 03:15 am

Joe Seigh wrote:
 
> That's the O(2n) solution.

There's no such thing as O(2n).
It's just O(n).

-- 
pete

.