C# | Check if a SortedList object has a fixed size

• Internally the object of SortedList maintain two arrays. The first array is used to store the elements of the list i.e. keys and the second one is used to store the associated values.
• A key cannot be null, but value can be.
• As SortedList uses sorting, it makes it slower in comparison to Hashtable.
• The capacity of a SortedList can be dynamically increased through reallocation.
• The keys in the SortedList cannot be duplicated but values can be.
• The SortedList can be sorted according to the keys using the IComparer(Either in ascending or descending order).

public virtual bool IsFixedSize { get; }

// C# code to check if a SortedList
// object has a fixed size
using System;
using System.Collections;

class GFG {

    // Driver code
    public static void Main()
    {

        // Creating an SortedList
        SortedList mySortedList = new SortedList();

        // Adding elements to SortedList
        mySortedList.Add("1", "one");
        mySortedList.Add("2", "two");
        mySortedList.Add("3", "three");
        mySortedList.Add("4", "four");
        mySortedList.Add("5", "five");

        // Checking if a SortedList
        // object has a fixed size
        Console.WriteLine(mySortedList.IsFixedSize);
    }
}

False

• A collection that is read-only does not allow the addition, removal, or modification of elements after the collection is created.
• Retrieving the value of this property is an O(1) operation.