Colon operator for ranges in MATLAB - Time & Space Complexity

Time Complexity: Colon operator for ranges

O(n)

Understanding Time Complexity

We want to understand how the time it takes to create a range using the colon operator changes as the range size grows.

How does the number of steps grow when we ask for longer ranges?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

range = 1:1000;

This code creates a list of numbers starting at 1 and ending at 1000, stepping by 1 each time.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Creating each number in the range one by one.
• How many times: Once for every number from start to end (1000 times in this example).

How Execution Grows With Input

When the range gets longer, the number of steps grows the same way.

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

Pattern observation: The operations grow directly in proportion to the size of the range.

Final Time Complexity

Time Complexity: O(n)

This means the time to create the range grows linearly with how many numbers you want.

Common Mistake

[X] Wrong: "Creating a range with the colon operator is instant no matter how big it is."

[OK] Correct: Even though the code looks simple, MATLAB actually creates each number in the range one by one, so bigger ranges take more time.

Interview Connect

Understanding how simple operations like creating ranges scale helps you think clearly about performance in real code, which is a valuable skill in any programming task.

Self-Check

"What if we changed the step size in the colon operator from 1 to 2? How would the time complexity change?"