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

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

weixin_34080903

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

阅读量58

点赞数

本文探讨了SortedList<TKey,TValue>与SortedDictionary<TKey,TValue>两类泛型类的区别。两者均采用二叉搜索树结构实现O(log n)检索效率。尽管如此，在内存使用与插入删除操作速度方面存在差异：SortedList<TKey,TValue>更节省内存，而SortedDictionary<TKey,TValue>对于无序数据的插入删除操作更快；若从有序数据一次性填充，则SortedList<TKey,TValue>表现更优。

摘要生成于 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>.