SortedList<TKey,TValue> 和 SortedDictionary<TKey,TValue>

最新推荐文章于 2025-04-20 08:11:53 发布

weixin_34174105

最新推荐文章于 2025-04-20 08:11:53 发布

阅读量126

点赞数

CC 4.0 BY-SA版权

原文链接：https://yq.aliyun.com/articles/38358

本文对比了SortedList<TKey,TValue>与SortedDictionary<TKey,TValue>两种泛型类的特性。前者内存占用较少，后者在未排序数据上的插入与删除操作更优；若一次性填充已排序的数据，则SortedList表现更快。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The SortedList<TKey, TValue> generic class is a binary search tree with O(log n) retrieval, where n is the number of elements in the dictionary. In this, it is similar to the SortedDictionary<TKey, TValue> generic class. The two classes have similar object models, and both have O(log n) retrieval. Where the two classes differ is in memory use and speed of insertion and removal:

1.SortedList<TKey, TValue> uses less memory than SortedDictionary<TKey, TValue>.

2.SortedDictionary<TKey, TValue> has faster insertion and removal operations for unsorted data, O(log n) as opposed to O(n) for SortedList<TKey, TValue>.

3.If the list is populated all at once from sorted data, SortedList<TKey, TValue> is faster than SortedDictionary<TKey, TValue>.