SortedSet in C# with Example for Loop

In C#, the SortedSet<T> class is a collection that maintains unique elements in sorted order. Its automatic sorting and set operations make it a powerful tool for specific use cases. Although it doesn't provide direct indexing, you can still use a for loop to iterate through its elements. This article explains how to work with SortedSet<T> using a for loop, with practical examples.

Why Use SortedSet?

• Unique Elements: Ensures no duplicates are stored.
• Automatic Sorting: Maintains elements in sorted order.
• Set Operations: Supports efficient set operations like union, intersection, and difference.

Example: Using SortedSet with a For Loop

Adding Elements and Iterating

using System;
using System.Collections.Generic;

public class SortedSetForLoopExample
{
    public static void Main()
    {
        // Create a SortedSet of strings
        SortedSet<string> fruits = new SortedSet<string> { "Apple", "Orange", "Banana", "Pineapple" };

        // Add more elements
        fruits.Add("Grape");
        fruits.Add("Watermelon");

        // Display the elements in sorted order using a for loop
        Console.WriteLine("Fruits in SortedSet (sorted):");
        int index = 0;
        foreach (string fruit in fruits)
        {
            Console.WriteLine($"{index}: {fruit}");
            index++;
        }

        // Find and print a specific fruit based on index
        int targetIndex = 2;
        string? foundFruit = GetElementByIndex(fruits, targetIndex);
        if (foundFruit != null)
        {
            Console.WriteLine($"\nFruit at index {targetIndex}: {foundFruit}");
        }
        else
        {
            Console.WriteLine($"\nNo fruit found at index {targetIndex}");
        }
    }

    // Method to find an element by index in a SortedSet
    public static string? GetElementByIndex(SortedSet<string> sortedSet, int index)
    {
        if (index < 0 || index >= sortedSet.Count)
        {
            return null; // Index out of range
        }

        int currentIndex = 0;
        foreach (string element in sortedSet)
        {
            if (currentIndex == index)
            {
                return element;
            }
            currentIndex++;
        }

        return null;
    }
}

Key Points to Note

• Unique Elements: Duplicate items will not be added.
• Enumeration: The foreach loop iterates through all elements in sorted order.

Practical Applications

• Data Analysis: Analyze unique and sorted data using efficient loops.
• Filtered Lists: Maintain unique and sorted lists for further processing.
• Ranking Systems: Manage sorted and unique data for ranking or scoring.

Conclusion

The SortedSet<T> class in C# provides a way to handle unique and sorted collections effectively. Using a for loop or foreach, you can access and manipulate these sorted elements, ensuring data remains unique and in order.

Sortedset in c# with example for loop