When will one prefer array, LinkedList or ArrayList over List?

Question

Is there any point of using those data types other then legacy code? Other data types like Dictionary or Graph are understandably used because they provide extra / different functionality. But array, LinkedList or ArrayList have less of a functionality and sometimes worst performance then List (ArrayList is less memory efficient in value types)

Then why use them at all?

Note: this is not an opinion - based question. All I want to know is use cases for these types

Another Note: I know about Linked list's O(1) insert time. I am asking when should it be utilized over the standard List, which has O(1) access time? When it is better to use? (and the question about ArrayList and array remains)

all containers have pro and cons.... from Complexity O(n) to sorting functionalities — ΦXocę 웃 Пepeúpa ツ, Sep 08 '20 at 09:29

Marc Gravell · Answer 1 · 2020-09-08T09:32:07.480

2

ArrayList? sure: don't use it, basically ever (unless you don't want to migrate some legacy code, or can't because somebody has unwisely used BinaryFormatter).

LinkedList<T>, however, is not in the same category - it is niche, but it has uses due to cheap insertion/removal/etc, unlike List<T> which would need to move data around to perform insertion/removal. In most scenarios, you probably don't need that feature, so: don't use it unless you do?

edited Sep 08 '20 at 09:32

answered Sep 08 '20 at 09:29

Marc Gravell

1,026,079
266
2,566
2,900

But which `List` you mean? You can't instantiate List, so there is no List. – Omid.N Sep 08 '20 at 09:32
1

@Omid.N um... yes you can (instantiate `List`); it isn't `abstract` (are you thinking of Java? note the question has a C# tag, so I'm talking .NET here) – Marc Gravell Sep 08 '20 at 09:32
Ah! sorry I thought it is a java question. – Omid.N Sep 08 '20 at 09:33

score 0 · Accepted Answer · edited Oct 25 '20 at 20:31

LinkedList

Here is a list of differentiators from the List implementation. You use it when the items in the list need to maintain a specific order (hence the next and previous references).

Represents a doubly linked list.

LinkedList<T> provides separate nodes of type LinkedListNode<T>, so insert and removal are O(1) operations.

You can remove nodes and reinsert them, either in the same list or in another list, which results in no additional objects allocated on the heap. Because the list also maintains an internal count, getting the Count property is an O(1) operation.

Each node in a LinkedList<T> object is of the type LinkedListNode<T>. Because the LinkedList<T> is doubly linked, each node points forward to the Next node and backward to the Previous node.

List Vs ArrayList

ArrayList is a deprecated implementation used in the past. Prefer List<T> generic implementation in any new code.

As a generic collection, List<T> implements the generic IEnumerable<T> interface and can be used easily in LINQ

ArrayList belongs to the days that C# didn't have generics. It's deprecated in favor of List<T>. You shouldn't use ArrayList in new code that targets .NET >= 2.0 unless you have to interface with an old API that uses it.

Array vs List

Array is a fixed size collection and it supports multiple dimensions. It is the most efficient of the three for simple insert and iterations.

When will one prefer array, LinkedList or ArrayList over List?

2 Answers2