in reply to Re: Data structure challenge
in thread Data structure challenge
That means, that if you were to store just one value, say U - 1, that insertion will cost you Θ (U) time. Which isn't O (1).
Abigail
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Re: Data structure challenge
by BrowserUk (Patriarch) on Mar 17, 2004 at 20:50 UTC |