Re: Optimal Structure for Inserting and Deleting

> Brady Kelly:
>
> > I chose a data structure that would preserve ordering during
> > inserts, deletes, and swaps, [...] a linked list seemed an
> > ideal initial choice.
>
> Frans Bouma:
>
> > So any sorted list does the trick. I'd opt for
> > SortedDictionary<K, V> [...] what you want is a sorted list?
>
> Looks like a non-sequitur here; nothing suggests sortedness is desired. A
> "linked list" (list, array, ...) sounds right. Right?

        perhaps I'm mistaken, but I read 'would preserve ordering during
inserts, deletes and swaps' as that it has to keep 'an' ordering set in the
list. As a random bucket of elements always has 'an' order, I pressume it's a
forced ordering, i.e. sorted. BUt perhaps I misinterpreted the requirements ;)

                FB

===================================
This list is hosted by DevelopMentor®  http://www.develop.com

View archives and manage your subscription(s) at http://discuss.develop.com