Switch-case statements in MATLAB - Time & Space Complexity

Time Complexity: Switch-case statements

O(n)

Understanding Time Complexity

We want to understand how the time it takes to run a switch-case statement changes as the number of cases grows.

Specifically, how does checking each case affect the total work done?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

switch value
    case 1
        disp('One');
    case 2
        disp('Two');
    case 3
        disp('Three');
    otherwise
        disp('Other');
end
    

This code checks the variable value against several cases and runs the matching block.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking each case one by one until a match is found.
• How many times: Up to the number of cases in the switch statement.

How Execution Grows With Input

As the number of cases increases, the program may need to check more cases before finding a match.

Input Size (number of cases)	Approx. Operations (case checks)
10	Up to 10 checks
100	Up to 100 checks
1000	Up to 1000 checks

Pattern observation: The number of checks grows directly with the number of cases.

Final Time Complexity

Time Complexity: O(n)

This means the time to find the matching case grows linearly with the number of cases.

Common Mistake

[X] Wrong: "Switch-case statements always run in constant time because they just jump to the right case."

[OK] Correct: Actually, the program may check cases one by one until it finds a match, so time grows with the number of cases.

Interview Connect

Understanding how switch-case statements scale helps you explain code efficiency clearly and shows you can think about how programs behave as they grow.

Self-Check

"What if the switch-case was replaced by a hash map lookup? How would the time complexity change?"