Sorted Collection Types
The System.Collections.SortedList class, the System.Collections.Generic.SortedList<TKey, TValue> generic class, and the System.Collections.Generic.SortedDictionary<TKey, TValue> generic class are similar to the Hashtable class and the Dictionary<TKey, TValue> generic class in that they implement the IDictionary interface, but they maintain their elements in sort order by key, and they do not have the O(1) insertion and retrieval characteristic of hash tables. The three classes have several features in common:
All three classes implement the System.Collections.IDictionary interface. The two generic classes also implement the System.Collections.Generic.IDictionary<TKey, TValue> generic interface.
Each element is a key/value pair for enumeration purposes.
Each class provides properties that return collections containing only the keys or only the values.
The following table lists some of the differences between the two sorted list classes and the SortedDictionary<TKey, TValue> class.
SortedDictionary<TKey, TValue> generic class
The properties that return keys and values are indexed, allowing efficient indexed retrieval.
No indexed retrieval.
Retrieval is O(log n).
Retrieval is O(log n).
Insertion and removal are generally O(n); however, insertion is O(1) for data that are already in sort order, so that each element is added to the end of the list. (This assumes that a resize is not required.)
Insertion and removal are O(log n).
Uses less memory than a SortedDictionary<TKey, TValue>.
For sorted lists or dictionaries that must be accessible concurrently from multiple threads, you can add sorting logic to a class that derives from ConcurrentDictionary<TKey, TValue>.
For values that contain their own keys (for example, employee records that contain an employee ID number), you can create a keyed collection that has some characteristics of a list and some characteristics of a dictionary by deriving from the KeyedCollection<TKey, TItem> generic class.
Starting with the .NET Framework 4, the SortedSet<T> class provides a self-balancing tree that maintains data in sorted order after insertions, deletions, and searches. This class and the HashSet<T> class implement the ISet<T> interface.