Question: Please select the tight time complexity of the following function in worst case. memset2(A, n, x) { for (int b = n; b < 2n;
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
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
