RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/c-sharp/c-sharp-remove-all-elements-from-the-sortedset/ below:

C# | Remove all elements from the SortedSet

Last Updated : 11 Jul, 2025

SortedSet

class represents the collection of objects in sorted order. This class comes under the

System.Collections.Generic

namespace.

SortedSet<T>.Clear Method

is used to remove the all elements from the SortedSet.

Properties:

In C#, SortedSet class can be used to store, remove or view elements.
It maintains ascending order and does not store duplicate elements.
It is suggested to use SortedSet class if you have to store unique elements and maintain ascending order.

Syntax:

mySortedSet.Clear();

Here,

mySortedSet

is the name of the SortedSet. Below given are some examples to understand the implementation in a better way:

Example 1: CSHARP


 // C# code to remove all the elements
// from SortedSet
using System;
using System.Collections.Generic;

class GFG {

    // Driver code
    public static void Main()
    {

        // Creating a SortedSet of strings
        SortedSet<string> mySortedSet = new SortedSet<string>();

        // adding elements in mySortedSet
        mySortedSet.Add("A");
        mySortedSet.Add("B");
        mySortedSet.Add("C");
        mySortedSet.Add("D");
        mySortedSet.Add("E");

        // Displaying number of elements in mySortedSet
        // before Removing all the elements
        Console.WriteLine("Number of elements in mySortedSet are : " 
                                               + mySortedSet.Count);

        // Displaying the element in mySortedSet
        foreach(string str in mySortedSet)
        {
            Console.WriteLine(str);
        }

        // Removing all the elements from mySortedSet
        mySortedSet.Clear();

        // Displaying number of elements in mySortedSet
        // after Removing all the elements
        Console.WriteLine("Number of elements in mySortedSet are : " 
                                               + mySortedSet.Count);
    }
}

Output:

Number of elements in mySortedSet are : 5
A
B
C
D
E
Number of elements in mySortedSet are : 0

Example 2: CSHARP


 // C# code to remove all the elements
// from SortedSet
using System;
using System.Collections.Generic;

class GFG {

    // Driver code
    public static void Main()
    {

        // Creating a SortedSet of integers
        SortedSet<int> mySortedSet = new SortedSet<int>();

        // adding elements in mySortedSet
        for (int i = 1; i <= 6; i++) {
            mySortedSet.Add(2 * i + 1);
        }

        // Displaying number of elements in mySortedSet
        // before Removing all the elements
        Console.WriteLine("Number of elements in mySortedSet are : " 
                                               + mySortedSet.Count);

        // Displaying the element in mySortedSet
        foreach(int i in mySortedSet)
        {
            Console.WriteLine(i);
        }

        // Removing all the elements from mySortedSet
        mySortedSet.Clear();

        // Displaying number of elements in mySortedSet
        // after Removing all the elements
        Console.WriteLine("Number of elements in mySortedSet are : "
                                               + mySortedSet.Count);
    }
}

Output:

Number of elements in mySortedSet are : 6
3
5
7
9
11
13
Number of elements in mySortedSet are : 0

Reference:

https://learn.microsoft.com/en-us/dotnet/api/system.collections.generic.sortedset-1.clear?view=netcore-2.1

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4