Multi-parameter indexers in C Sharp (C#) - Time & Space Complexity

Time Complexity: Multi-parameter indexers

O(1)

Understanding Time Complexity

When using multi-parameter indexers, it is important to understand how the time to access elements changes as the size of the data grows.

We want to know how the number of operations grows when we use multiple keys to get or set values.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public class Matrix
{
    private int[,] data = new int[100, 100];

    public int this[int row, int col]
    {
        get => data[row, col];
        set => data[row, col] = value;
    }
}

This code defines a matrix with a two-parameter indexer to get or set values by row and column.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Direct access to a two-dimensional array element.
• How many times: Each access is a single operation, no loops or repeated traversals inside the indexer.

How Execution Grows With Input

Accessing an element by two indices takes the same amount of time regardless of the size of the matrix.

Input Size (n x n)	Approx. Operations
10 x 10	1
100 x 100	1
1000 x 1000	1

Pattern observation: The time to access an element does not increase as the matrix grows larger.

Final Time Complexity

Time Complexity: O(1)

This means accessing or setting a value using a multi-parameter indexer takes the same fixed time no matter how big the data is.

Common Mistake

[X] Wrong: "Using two indices means the operation takes twice as long or grows with the size of the matrix."

[OK] Correct: The two indices directly access the memory location without looping, so the time stays constant regardless of size.

Interview Connect

Understanding how multi-parameter indexers work helps you explain efficient data access in real applications, showing you grasp how data structures perform under the hood.

Self-Check

"What if the indexer performed a search through the data instead of direct access? How would the time complexity change?"