Space complexity analysis in Data Structures Theory - Time & Space Complexity

Time Complexity: Space complexity analysis

O(n)

Understanding Time Complexity

We want to understand how much extra memory a program uses as the input size grows.

The question is: how does the space needed change when the input gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

function createArray(n) {
  let arr = [];
  for (let i = 0; i < n; i++) {
    arr.push(i);
  }
  return arr;
}
    

This code creates an array and fills it with numbers from 0 up to n-1.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding one item to the array inside a loop.
• How many times: Exactly n times, once for each number from 0 to n-1.

How Execution Grows With Input

As n grows, the array grows by one item each time the loop runs.

Input Size (n)	Approx. Memory Used (items)
10	10 items
100	100 items
1000	1000 items

Pattern observation: Memory use grows directly with input size; doubling n doubles memory needed.

Final Time Complexity

Time Complexity: O(n)

This means the memory needed grows in a straight line as the input size grows.

Common Mistake

[X] Wrong: "The memory used stays the same no matter how big n is."

[OK] Correct: Since the array stores n items, more input means more memory is needed.

Interview Connect

Understanding how memory grows with input helps you write programs that use resources wisely and avoid crashes.

Self-Check

What if the code created a two-dimensional array with n rows and n columns? How would the memory use change?

Practice

1. What does space complexity measure in an algorithm?

easy

A. The number of steps the algorithm performs

B. The time it takes for the algorithm to run

C. The number of errors the algorithm produces

D. The amount of memory the algorithm uses as input size grows

Solution

1. Step 1: Understand the definition of space complexity

   Space complexity refers to how much memory or storage an algorithm needs while running, especially as the input size increases.

2. Step 2: Differentiate from time complexity

   Time complexity measures how long an algorithm takes, not memory usage. Hence, space complexity is about memory.

3. Final Answer:

   The amount of memory the algorithm uses as input size grows -> Option D

4. Quick Check:

   Space complexity = memory usage [OK]

Hint: Space complexity = memory needed as input grows [OK]

Common Mistakes:

• Confusing space complexity with time complexity
• Thinking it measures steps or errors
• Ignoring memory usage in the definition

2. Which of the following correctly represents constant space complexity in Big O notation?

easy

A. O(n)

B. O(1)

C. O(n^2)

D. O(log n)

Solution

1. Step 1: Recall Big O notation for constant space

   Constant space means the algorithm uses the same amount of memory regardless of input size.

2. Step 2: Identify the notation for constant space

   O(1) means constant space, O(n) means linear, O(n^2) quadratic, and O(log n) logarithmic space.

3. Final Answer:

   O(1) -> Option B

4. Quick Check:

   Constant space = O(1) [OK]

Hint: Constant space always uses O(1) [OK]

Common Mistakes:

• Choosing O(n) for constant space
• Confusing time and space complexity notations
• Misunderstanding logarithmic space

3. Consider the following pseudocode:
function example(arr):
  temp = []
  for i in arr:
    temp.append(i)
  return temp
What is the space complexity of this function?

medium

A. O(n^2)

B. O(1)

C. O(n)

D. O(log n)

Solution

1. Step 1: Analyze memory usage for the temporary list

   The function creates a new list 'temp' and appends each element from input 'arr', so 'temp' grows linearly with input size n.

2. Step 2: Determine space complexity based on 'temp'

   Since 'temp' stores all elements, space used is proportional to n, so space complexity is O(n).

3. Final Answer:

   O(n) -> Option C

4. Quick Check:

   New list size = input size n -> O(n) space [OK]

Hint: Extra list storing all input means O(n) space [OK]

Common Mistakes:

• Assuming constant space because no nested loops
• Confusing time complexity with space complexity
• Ignoring the temporary list's size

4. Identify the error in the following code regarding space complexity:
def process(n):
  result = 0
  for i in range(n):
    temp = [0] * n
    result += sum(temp)
  return result
What is the space complexity and what is the mistake?

medium

A. O(n), mistake: temp list is recreated inside loop causing high memory use

B. O(1), mistake: temp list should be outside loop to save memory

C. O(n^2), mistake: temp list size grows each iteration

D. O(n), mistake: result variable should be a list

Solution

1. Step 1: Analyze space used by 'temp' inside the loop

   Each iteration creates a list 'temp' of size n, but it is discarded after the iteration ends, so peak memory is O(n).

2. Step 2: Identify the mistake in memory usage

   Recreating 'temp' inside the loop wastes memory repeatedly; better to create once outside the loop.

3. Final Answer:

   O(n), mistake: temp list is recreated inside loop causing high memory use -> Option A

4. Quick Check:

   Repeated list creation inside loop = O(n) space [OK]

Hint: Creating large lists inside loops wastes memory [OK]

Common Mistakes:

• Thinking space is O(1) because temp is local
• Assuming temp grows each iteration (it doesn't)
• Confusing time complexity with space complexity

5. You have a nested list of size n, where each element is a list of size n (an n x n matrix). You want to create a new list that contains the sum of each inner list. What is the space complexity of storing the sums?

hard

A. O(n)

B. O(log n)

C. O(1)

D. O(n^2)

Solution

1. Step 1: Understand the input structure

   The input is an n x n matrix (list of n lists, each of size n), so total elements are n^2.

2. Step 2: Analyze the output list size

   The output list stores one sum per inner list, so it has n elements, which means space complexity is O(n).

3. Final Answer:

   O(n) -> Option A

4. Quick Check:

   One sum per inner list -> O(n) space [OK]

Hint: One value per inner list means O(n) space [OK]

Common Mistakes:

• Assuming output space is O(n^2) like input
• Confusing input size with output size
• Ignoring that sums reduce data size