flatten() and ravel() for 1D conversion in NumPy - Time & Space Complexity

Time Complexity: flatten() and ravel() for 1D conversion

O(n)

Understanding Time Complexity

We want to understand how the time to convert a multi-dimensional array to one dimension grows as the array size increases.

Specifically, we look at numpy's flatten() and ravel() methods.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import numpy as np

arr = np.arange(1000).reshape(100, 10)
flat_arr = arr.flatten()
raveled_arr = arr.ravel()

This code creates a 2D array and converts it to 1D using flatten() and ravel().

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Reading all elements of the array to create a 1D copy or view.
• How many times: Once for each element in the array (n times, where n is total elements).

How Execution Grows With Input

As the number of elements grows, the time to flatten or ravel grows roughly in direct proportion.

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

Pattern observation: The work grows linearly as the array size increases.

Final Time Complexity

Time Complexity: O(n)

This means the time to convert grows directly with the number of elements in the array.

Common Mistake

[X] Wrong: "ravel() is always faster because it never copies data."

[OK] Correct: Sometimes ravel() must copy data if the array is not stored contiguously, so it can take similar time as flatten().

Interview Connect

Knowing how these methods scale helps you choose the right tool when working with large data arrays in real projects.

Self-Check

"What if we used flatten(order='F') instead of the default? How would the time complexity change?"