Difference between SortedList and SortedDictionary in C#

In this article, you will learn about the difference between SortedList and SortedDictionary in C#. But before discussing their differences, you must know about the SortedList and SortedDictionary.

What is the SortedList?

The C# collection class SortedList represents a collection of key/value pairs with entries ordered by keys. It is part of the System.Collections namespace. SortedList uses a dynamic array to hold its elements. The elements are kept in sorted order based on their keys. Binary search is employed for efficient retrieval of elements based on keys.

1. Key characteristics

Sorted Order:

Maintaining a sorted order of elements based on keys is the primary characteristic of a SortedList.
Binary search algorithms can be used to search effectively as a result.

Array-Based Structure

SortedList internally stores key/value pairs in an array.
When necessary, this array's size is dynamically changed.

2. Performance

Quick Access with an Index

It is similar to a regular array, allowing for quick access to elements by index.
O(1) time complexity applies to element retrieval via index.

Slower Insertions and Removals

Insertions and removals may be slower than other data structures like Dictionary or SortedDictionary because maintaining the sorted order may involve shifting elements.

3. Memory Overhead

Lower Memory Overhead

Generally, it has lower memory overhead than other sorted data structures due to its simple array-based implementation.

4. Use Cases

Frequent Index-Based Access

It is well-suited for scenarios where frequent index-based access to elements is required.

Relatively Static Collections

It is perfect for scenarios in which the collection is largely static because dynamic resizing can have a negative impact on performance.

Example:

Let us take an example to illustrate the SortedList in C#.

using System;
using System.Collections;
class Program
{
 static void Main()
 {
 // Create a new SortedList
 SortedList sortedList = new SortedList();
 // Add elements to the SortedList
 sortedList.Add(3, "Three");
 sortedList.Add(1, "One");
 sortedList.Add(2, "Two");
 sortedList.Add(4, "Four");
 // Display the elements in sorted order
 Console.WriteLine("Sorted List Elements:");
 foreach (DictionaryEntry entry in sortedList)
 {
 Console.WriteLine($"Key: {entry.Key}, Value: {entry.Value}");
 }
 // Accessing elements by key
 int keyToFind = 2;
 if (sortedList.ContainsKey(keyToFind))
 {
 Console.WriteLine($"Value for Key {keyToFind}: {sortedList[keyToFind]}");
 }
 else
 {
 Console.WriteLine($"Key {keyToFind} not found.");
 }
 }
}

Output:

Sorted List Elements:
Key: 1, Value: One
Key: 2, Value: Two
Key: 3, Value: Three
Key: 4, Value: Four
Value for Key 2: Two

Explanation:

1. Namespace and Class Declaration

A namespace (System) and a class (Program) are declared at the start of the code.

2. Main Method

The Main method is the program's entry point.

3. Creating a SortedList

Using new SortedList(), a new SortedList instance called sortedList is created.

4. Adding Elements

Using the Add method, key-value pairs are added to the SortedList.

Strings are values, and integers are keys.

5. Sorted Elements Are Displayed

After that, the program enters a loop to iterate through the elements of the SortedList.

Key-value pairs are accessed using a foreach loop that uses DictionaryEntry as the loop variable type.

Based on the keys, the values and keys are arranged in a certain order on the console.

6. Using a Key to Access Elements

The program demonstrates how to access elements by key using the indexer ([]) syntax and the ContainsKey method.

In this case, it checks if the key 2 exists in the SortedList.

If the key is found, it prints the corresponding value; otherwise, it prints a message indicating it was not found.

7. Output

The sorted key-value pairs and the result of using a particular key to access an element are displayed in the console output.

This code provides a basic example of using a SortedList in C# to store, retrieve, and display sorted key-value pairs. The SortedList class automatically maintains the sorting order based on the keys.

What is the SortedDictionary?

The C# collection class SortedDictionary represents a collection of key/value pairs, where keys sort the elements. It is part of the System.Collections.Generic namespace. SortedDictionary stores key/value pairs in a Red-Black tree, a self-balancing binary search tree. With logarithmic time complexity, the tree structure ensures effective searching, insertion, and removal operations.

1. Key Characteristics

Sorted Order

The essential characteristic of SortedDictionary is that its elements are kept in a sorted order according to keys.
The Red-Black tree automatically balances itself during operations to maintain efficient search times.

Balanced Tree Structure

The Red-Black tree structure maximises search, insert, and delete operations by ensuring that the tree's height stays logarithmic.

2. Performance

Fast Insertions and Removals

SortedDictionary's balanced Red-Black tree allows for quick insertion and removal operations.
Operations have a time complexity of O(log n).

Slower Access by Index

Index-based element access is slower than SortedList access since it requires tree traversal.

3. Memory Overhead

Higher Memory Overhead

Generally, it has a higher memory overhead than SortedList due to the tree structure and additional nodes.

4. Use Cases

Frequent Insertions and Removals

It is well-suited for scenarios where frequent insertions and removals are expected.

Dynamic Collections

It is appropriate for scenarios where the collection is subject to frequent changes.

Example:

Let us take an example to illustrate the SortedDictionary in C#.

using System;
using System.Collections.Generic;
class Program
{
 static void Main()
 {
 // Create a new SortedDictionary
 SortedDictionary<int, string> sortedDictionary = new SortedDictionary<int, string>();
 // Add elements to the SortedDictionary
 sortedDictionary.Add(3, "Three");
 sortedDictionary.Add(1, "One");
 sortedDictionary.Add(2, "Two");
 sortedDictionary.Add(4, "Four");
 // Display the elements in sorted order
 Console.WriteLine("Sorted Dictionary Elements:");
 foreach (var kvp in sortedDictionary)
 {
 Console.WriteLine($"Key: {kvp.Key}, Value: {kvp.Value}");
 }
 }
}

Output:

Sorted Dictionary Elements:
Key: 1, Value: One
Key: 2, Value: Two
Key: 3, Value: Three
Key: 4, Value: Four

Explanation:

1. Class Declaration and Namespace

The Program class is declared at the start of the code.

It includes the System and System.Collections.Generic namespaces.

2. Main Method

The program's entry point is the Main method.

3. Creating a SortedDictionary

The SortedDictionary<int, string> class is generated as a new instance.

Key-value pairs with values of type string and keys of type int are stored in SortedDictionary.

4. Adding Elements to SortedDictionary

Using the Add method, key-value pairs are added to the SortedDictionary.

In this example, the values are strings ("Three," "One," "Two," and "Four"), and the keys are numbers (3, 1, 2, 4).

5. Displaying the Elements

The code iterates through the SortedDictionary using a foreach loop.

Key and Value properties of each key-value pair (KeyValuePair<int, string>) in the SortedDictionary are accessed to show key-value pairs in sorted order.

6. Output

The program produces the sorted list of key-value pairs, displaying the keys and their corresponding values.

This code shows how to create an instance, add elements, and loop through the sorted key-value pairs of a SortedDictionary in C#. Based on the keys, the SortedDictionary automatically maintains the sorted order.

Difference between SortedList and SortedDictionary in C#

The primary difference between SortedList and SortedDictionary in C# lies in their underlying data structures and performance characteristics.

1. Underlying Data Structures

SortedList

It uses an array to store key-value pairs.
It maintains the keys in a sorted order.
It utilises effective use of binary search for retrieval.

SortedDictionary

Use a self-balancing binary search tree called Red-Black to store key-value pairs.
Maintains a sorted order based on the keys.
The balanced structure of the tree allows for optimal insertion, removal, and search operations.

2. Performance Characteristics

SortedList

It provides quick access to elements by index (O(1)).
Slower insertion and removal operations (O(n)) than in SortedDictionary because shifting elements to maintain the sorted order could be necessary.

SortedDictionary

Provides quick insertion and removal operations (O(log n)) since the Red-Black tree is self-balancing.
Access by index is slower than with SortedList because tree traversal is necessary (O(log n)).

3. Memory Overhead

SortedList

Generally, it has lower memory overhead as it only needs to store keys and values in a simple array.

SortedDictionary

Tends to have higher memory overhead due to the tree structure and additional nodes.

4. Use Cases

SortedList

It is suitable when frequent index-based access is required.
It is appropriate for scenarios where the collection remains relatively

SortedDictionary

It is suitable when efficient insertions and removals are crucial, especially in dynamic collections.
It is appropriate for scenarios where the collection may undergo frequent changes.

5. Index-based Access

SortedList

Allows it possible to access elements by index

SortedDictionary

It doesn't provide index-based direct access. Use of the Keys and Values properties or iteration are required.

6. Interface Implementation

SortedList

It implements the IDictionary and IList

SortedDictionary

It implements the IDictionary interface.

7. Operations of Insertion and Removal

SortedList

Insertion and removal processes are slower than with SortedDictionary because shifting elements could be involved.

SortedDictionary

Red-black tree self-balancing allows for faster insertion and removal processes.

Conclusion:

While both SortedList and SortedDictionary offer sorted key-value pairs, their differences in data structures and performance characteristics make them better suited for specific scenarios. SortedList is more efficient for scenarios requiring frequent index-based access in relatively static collections, whereas SortedDictionary excels in situations with dynamic collections that undergo frequent insertions and removals.

Next TopicDifference between Static Constructors and Non-Static Constructors in C#

← prev next →