Question

There are two matrices A and B of size nXn. The data in both these matrices
resides only at positions where both the indices are a perfect square. Rest all
positions have 0 as the data. Manuj has available a third matrix initialized with 0's at
all positions. He writes an efficient code to put the sum of A and B in C. What is the
time complexity of Manuj's program?
Op 1: θ(n^2)
Op 2: θ(n)
Op 3: θ(n1/2)
Op 4: θ(log(n))

Answer 1

Answer:

I think correct answer is option 3

hope this answer will help you.