SortedList class is a collection of (key, value) pairs which are sorted according to keys. Those pairs can be accessible by key and as well as by index(zero-based indexing). This comes under System.Collections namespace. SortedList.Remove(Object) method is used to remove the element with the specified key from a SortedList object.
- A SortedList element can be accessed by its key or by its index.
- A SortedList object internally maintains two arrays to store the elements of the list, i.e, one array for the keys and another array for the associated values.
- A key cannot be null, but a value can be.
- The capacity of a SortedList object is the number of elements the SortedList can hold.
- A SortedList does not allow duplicate keys.
- Operations on a SortedList object tend to be slower than operations on a Hashtable object because of the sorting.
- Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based.
public virtual void Remove (object key);
Here, key is the key of the element to remove.
- NotSupportedException : If the SortedList object is read-only or the SortedList has a fixed size.
- ArgumentNullException : If the key is null.
Below given are some examples to understand the implementation in a better way:
Key = CH Key = GER Key = IN Key = NY Key = UK Key = CHINA Key = GERMANY Key = INDIA Key = NEW-YORK Key = UNITED KINGDOM Removing element having key as UK Key = CH Key = GER Key = IN Key = NY Key = CHINA Key = GERMANY Key = INDIA Key = NEW-YORK
System.ArgumentNullException: Key cannot be null.
Parameter name: key
- If the SortedList object does not contain an element with the specified key, the SortedList remains unchanged. No exception is thrown.
- This method is an O(n) operation, where n is Count.