As far as I know, there is no way to get a List<T> with the capacity to sort itself. If I add a element, I want the data-structure to insert it in the right position (based on the associated IComparer<T> ). I am looking for something with the same logic than SortedSet<T> .

I am aware of System.Collections.Generic.SortedList<TKey, TValue> but it is more a kind of Dictionary .

I don't really need one (it is not very difficult to implement). I just wonder whether a such data-structure exists and if not, why?

source: