Question: ASAP Subject: Analysis of Algorithm Please select the tight time complexity of the following function in worst case. memset2(A, n, x) { for (int b

ASAP

Subject: Analysis of Algorithm

Please select the tight time complexity of the following function in worst case.

memset2(A, n, x)

{

for (int b = n; b < 2n; b++)

for (int i = b; i < b+512; ++i)

j=i%n

A[j] = x

}

A. O(n)

B. O(1)

C. O(n log n)

D. O(n2)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!