Difference between ArrayList and List<object> ?

20 Oct 2006 8:23 AM

Murat Ozgur

Hello,

Is there any difference between ArrayList and List<object> ? Which
one should I use ?

Thanks.

20 Oct 2006 10:57 AM

Nicolas Guinet

ArrayList (donet 1.1) is obsolete in dotnet 2.0
You must use List<T>
more performant than ArrayList
access to element is done in constant time

LinkedList<T> : time to access an element depend of the number of elements
but add is done in constant time

Regards
Nicolas Guinet

"Murat Ozgur" <muratoz***@gmail.com> a écrit dans le message de news:

1161332607.659706.187***@m7g2000cwm.googlegroups.com...
Show quote

> Hello,
>
> Is there any difference between ArrayList and List<object> ? Which
> one should I use ?
>
> Thanks.
>

20 Oct 2006 2:24 PM

David Anton

ArrayList is not obsolete in .NET 2, but it is nearly always a poor choice.
List<T> is a superior alternative since you can specify exactly what your
list contains and not have to cast back from object when reading from the
list.

--
David Anton
www.tangiblesoftwaresolutions.com
Instant C#: VB to C# converter
Instant VB: C# to VB converter
Instant C++: C#/VB to C++ converter
Instant Python: VB to Python converter

Show quote

"Nicolas Guinet" wrote:

> ArrayList (donet 1.1) is obsolete in dotnet 2.0
> You must use List<T>
> more performant than ArrayList
> access to element is done in constant time
>
> LinkedList<T> : time to access an element depend of the number of elements
> but add is done in constant time
>
> Regards
> Nicolas Guinet
>
> "Murat Ozgur" <muratoz***@gmail.com> a Ã©crit dans le message de news:
> 1161332607.659706.187***@m7g2000cwm.googlegroups.com...
> > Hello,
> >
> > Is there any difference between ArrayList and List<object> ? Which
> > one should I use ?
> >
> > Thanks.
> >
>
>
>

29 Nov 2006 5:17 PM

modosansreves

Nicolas Guinet íàïèñàâ:

> ArrayList (donet 1.1) is obsolete in dotnet 2.0
> You must use List<T>
> more performant than ArrayList
> access to element is done in constant time

In any container with O(n) elements the most we can have is the
O(log(n)) access time.

Show quote

>
> LinkedList<T> : time to access an element depend of the number of elements
> but add is done in constant time
>
> Regards
> Nicolas Guinet
>
> "Murat Ozgur" <muratoz***@gmail.com> a ecrit dans le message de news:
> 1161332607.659706.187***@m7g2000cwm.googlegroups.com...
> > Hello,
> >
> > Is there any difference between ArrayList and List<object> ? Which
> > one should I use ?
> >
> > Thanks.
> >