CSC format (Compressed Sparse Column) in SciPy - Time & Space Complexity

Time Complexity: CSC format (Compressed Sparse Column)

O(n + k)

Understanding Time Complexity

We want to understand how fast operations run when using the CSC format in scipy.

Specifically, how does the time to access or process data grow as the matrix size grows?

Scenario Under Consideration

Analyze the time complexity of accessing all nonzero elements column by column in a CSC matrix.

from scipy.sparse import csc_matrix

# Create a sparse matrix in CSC format
matrix = csc_matrix([[0, 0, 3], [4, 0, 0], [0, 5, 0]])

# Access nonzero elements column-wise
for col in range(matrix.shape[1]):
    start = matrix.indptr[col]
    end = matrix.indptr[col + 1]
    for data_index in range(start, end):
        row = matrix.indices[data_index]
        value = matrix.data[data_index]
        # process value

This code loops through each column and accesses all nonzero values in that column.

Identify Repeating Operations

Look at what repeats in the code:

• Primary operation: Looping over each column, then looping over nonzero elements in that column.
• How many times: Outer loop runs once per column (n times), inner loop runs once per nonzero element in that column.

How Execution Grows With Input

As the matrix grows, the number of columns and nonzero elements increase.

Input Size (n columns)	Approx. Operations (nonzero elements)
10	Depends on nonzero count, e.g., 20
100	About 200 nonzero elements
1000	About 2000 nonzero elements

Pattern observation: The total operations grow roughly with the number of nonzero elements, not just columns.

Final Time Complexity

Time Complexity: O(n + k)

This means the time grows with the number of columns plus the number of nonzero elements.

Common Mistake

[X] Wrong: "Accessing elements in CSC format takes time proportional to total matrix size (rows x columns)."

[OK] Correct: CSC stores only nonzero elements, so time depends on columns and nonzero count, not all elements.

Interview Connect

Understanding how sparse matrix formats affect operation speed helps you explain efficient data handling in real projects.

Self-Check

"What if we changed from CSC to CSR format? How would the time complexity for accessing elements change?"

Practice

1. What does the CSC format in scipy.sparse primarily store for a sparse matrix?

easy

A. Only non-zero values and their row indices, organized by columns

B. All values including zeros, organized by rows

C. Only zero values and their column indices

D. All values including zeros, organized by columns

Solution

1. Step 1: Understand CSC format storage

   CSC stands for Compressed Sparse Column, which stores only non-zero values and their row indices, grouped by columns.

2. Step 2: Compare options with CSC definition

   Only non-zero values and their row indices, organized by columns matches the CSC format definition exactly, while others include zeros or wrong organization.

3. Final Answer:

   Only non-zero values and their row indices, organized by columns -> Option A

4. Quick Check:

   CSC stores non-zero values by columns = A [OK]

Hint: CSC stores non-zero values by columns only [OK]

Common Mistakes:

• Thinking CSC stores zero values
• Confusing CSC with CSR (row-based)
• Assuming all values are stored

2. Which of the following is the correct way to create a CSC matrix from a dense NumPy array arr in Python using SciPy?

easy

A. scipy.sparse.csc_matrix(arr)

B. scipy.sparse.csr_matrix(arr)

C. scipy.sparse.dense_matrix(arr)

D. scipy.sparse.csc(arr)

Solution

1. Step 1: Identify correct SciPy function for CSC

   The function to create a CSC matrix is scipy.sparse.csc_matrix().

2. Step 2: Check options for syntax correctness

   scipy.sparse.csc_matrix(arr) uses the correct function and syntax. scipy.sparse.csr_matrix(arr) creates CSR, not CSC. Options C and D are invalid functions.

3. Final Answer:

   scipy.sparse.csc_matrix(arr) -> Option A

4. Quick Check:

   Use csc_matrix() to create CSC format [OK]

Hint: Use csc_matrix() to create CSC sparse matrix [OK]

Common Mistakes:

• Using csr_matrix instead of csc_matrix
• Trying non-existent functions like dense_matrix
• Missing _matrix suffix in function name

3. Given the following code, what will be the output of print(csc_matrix.indptr)?

import numpy as np
from scipy.sparse import csc_matrix

arr = np.array([[0, 0, 3],
                [4, 0, 0],
                [0, 5, 6]])
csc_matrix = csc_matrix(arr)

medium

A. [0 2 3 4]

B. [0 1 2 3]

C. [0 1 3 4]

D. [0 1 2 4]

Solution

1. Step 1: Understand indptr in CSC format

   indptr array shows column start indices in data arrays. For 3 columns, length is 4.

2. Step 2: Count non-zero elements per column

   Column 0 has 1 non-zero (4), column 1 has 1 non-zero (5), column 2 has 2 non-zeros (3,6). So indptr = [0,1,2,4].

3. Final Answer:

   [0 1 2 4] -> Option D

4. Quick Check:

   indptr counts cumulative non-zeros per column = B [OK]

Hint: Count non-zeros per column cumulatively for indptr [OK]

Common Mistakes:

• Counting rows instead of columns
• Mixing up indptr with indices array
• Off-by-one errors in cumulative counts

4. Identify the error in this code snippet that tries to create a CSC matrix:

from scipy.sparse import csc_matrix

arr = [[1, 0], [0, 2]]
csc = csc_matrix(arr, shape=(3,3))
print(csc.toarray())

medium

A. toarray() method does not exist for csc_matrix

B. Input array must be a NumPy array, not a list

C. Shape parameter is larger than input array size causing mismatch

D. csc_matrix requires data type float, not int

Solution

1. Step 1: Check input array and shape parameter

   Input array is 2x2 but shape is set to 3x3, causing dimension mismatch.

2. Step 2: Understand effect of shape mismatch

   Specifying a larger shape than data size is invalid and raises an error.

3. Final Answer:

   Shape parameter is larger than input array size causing mismatch -> Option C

4. Quick Check:

   Shape must match input size or smaller [OK]

Hint: Shape must match or be smaller than input array size [OK]

Common Mistakes:

• Assuming lists are invalid input
• Thinking data type must be float
• Believing toarray() is missing

5. You have a large sparse matrix representing user-item ratings with mostly zeros. You want to efficiently compute the sum of ratings for each item (column). Which approach using CSC format is best?

hard

A. Convert to dense array and sum all values using np.sum()

B. Convert to CSC format and sum non-zero values column-wise using .sum(axis=0)

C. Convert to CSR format and sum non-zero values row-wise using .sum(axis=1)

D. Use COO format and iterate over all entries to sum columns manually

Solution

1. Step 1: Understand CSC format advantage

   CSC stores data column-wise, making column operations like sum efficient.

2. Step 2: Choose best method for column sums

   Using .sum(axis=0) on CSC matrix efficiently sums columns without converting to dense.

3. Final Answer:

   Convert to CSC format and sum non-zero values column-wise using .sum(axis=0) -> Option B

4. Quick Check:

   CSC + sum(axis=0) = fast column sums [OK]

Hint: Use CSC and sum(axis=0) for fast column sums [OK]

Common Mistakes:

• Using CSR which is row-based for column sums
• Converting to dense wastes memory
• Manually iterating instead of vectorized sum