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.
Properties of SortedList:
- Internally the object of SortedList maintains two arrays. The first array is used to store the elements of the list i.e. keys and the second one is used to store the associated values.
- A key cannot be null but value can be.
- As SortedList used sorting which makes it slower in comparison to Hashtable.
- The capacity of a SortedList can be dynamically increased through reallocation.
- The keys in the SortedList cannot be duplicated but values can be.
- The SortedList can be sorted according to the keys using the IComparer(Either in ascending or descending order).
Below programs illustrate how to create a SortedList:
- How to create a shallow copy of SortedList Object in C#
- C# | Get or set the value associated with specified key in SortedList
- C# | How to add key/value pairs in SortedList
- C# | Capacity of a SortedList
- C# | SortedList Class
- C# SortedList with Examples
- C# | Getting index of the specified value in a SortedList object
- Difference between SortedList and SortedDictionary in C#
- C# | Remove all elements from a SortedList
- C# | Check if a SortedList is read-only
- C# | Getting the index of the specified key in a SortedList object
- C# | Get an enumerator that iterates through the SortedList
- C# | Remove from the specified index of a SortedList
- C# | Search in a SortedList object
- C# | Getting the Values in a SortedList object
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.