ArrayList represents an ordered collection of an object that can be indexed individually. It is basically an alternative to an array. It also allows dynamic memory allocation, adding, searching and sorting items in the list. ArrayList.Insert(Int32, Object) method inserts an element into the ArrayList at the specified index.
Properties of ArrayList Class:
- Elements can be added or removed from the Array List collection at any point in time.
- The ArrayList is not guaranteed to be sorted.
- The capacity of an ArrayList is the number of elements the ArrayList can hold.
- Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based.
- It also allows duplicate elements.
- Using multidimensional arrays as elements in an ArrayList collection is not supported.
public virtual void Insert (int index, object value);
index : It is the zero-based index at which value should be inserted.
value : It is the Object which is to be inserted. The value can be null.
- ArgumentOutOfRangeException : If index is less than zero or index is greater than Count i.e, number of elements in the ArrayList.
- NotSupportedException : If the ArrayList is read-only or the ArrayList has a fixed size.
Below given are some examples to understand the implementation in a better way:
The initial ArrayList is : A B C The ArrayList after Inserting elements is : A D B C E F
The initial ArrayList is : 1 2 3 The ArrayList after Inserting elements is : 6 5 4 1 2 3
- If index is equal to Count i.e, number of elements in the ArrayList, value is added to the end of ArrayList.
- This method is an O(n) operation, where n is Count.