This is not funny!
Skiplist is essentially an optimized version of Doug's idea that ends up
using a logrithmically scaling vector of pointers. Secondly, linked lists in
real scenarios make sense only when there is some satellite data associated
with the keys. So maintaining just pointers gives you
On Jun 11, 12:25 am, "zee 99" <[EMAIL PROTECTED]> wrote:
> is this the best one even if the list is sorted ( or any other constraint
> like this is applied ) ??
>
> On 6/11/08, Mohammad Moghimi <[EMAIL PROTECTED]> wrote:
>
>
>
> > No, I think O(n) is the best method one can use
> > On Wed, Jun 1
Call For Participation
WORLDCOMP'08
The 2008 World Congress in Computer Science,
Computer Engineering, and Applied Computing
Date and Location: July 14-17, 2008, Las Vegas, USA
http://www.world-academy-of-s
