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.RemoveRange(Int32, Int32) method is used to remove a range of elements from the ArrayList.
Properties of the 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 RemoveRange (int index, int count);
index : It is the zero-based starting index of the range of elements to remove.
count : It is the number of elements which is to be removed.
- ArgumentOutOfRangeException : If index is less than zero or count is less than zero.
- ArgumentException : If index and count do not denote a valid range of elements in the ArrayList.
- NotSupportedException : If the ArrayList is read-only or the ArrayList has a fixed size.
Note: This method is an O(n) operation, where n is Count.
Below programs illustrate the use of ArrayList.RemoveRange(Int32, Int32) method:
The initial ArrayList is: A B C D E F G H I J The ArrayList after Removing elements: A B E F G H I J
The initial ArrayList is: 2 4 6 8 10 12 14 16 18 20 The ArrayList after Removing elements: 10 12 14 16 18 20
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.