Given the flowing piece of code, in the worst case it is big-Θ of what (where the input is of size n)? Foo(A) 1 k = 0 2 for i = 1 to A.length 3 A[i] = A[i] + 1 4 for j = 1 to A. length - i 5 A[j] = A[j] * A[i] 6 if A[j] > 20 7 k = k + 1 8 A[i] = k 9 for i = 1 to A.length / 2 10 exchange A[i] with A[A.length + 1 - i]

Given the flowing piece of code, in the worst case it is big-Θ of what (where the input is of size n)? Foo(A) 1 k = 0 2 for i = 1 to A.length 3 A[i] = A[i] + 1 4 for j = 1 to A. length - i 5 A[j] = A[j] * A[i] 6 if A[j] > 20 7 k = k + 1 8 A[i] = k 9 for i = 1 to A.length / 2 10 exchange A[i] with A[A.length + 1 - i]

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 7PE

See similar textbooks

Similar questions

Give an NFA over a single letter alphabet that rejects some string, but the length of the shortest rejected string is strictly more than the number of states. (Hint: Build an NFA with seven states arranged in loops of length two and five. Assign start and final states so that the shortest rejected string is of length 9 = 2 * 5 − 1.)
How do I get rid of my division by zero error? def sine(M, N, tol=1e-14): x = linspace(-2 * pi, 2 * pi, M) w = ones(N) for i in range(0, N): if i == 0: w[i] = (-1) ** i / 2 elif i == N - 1: w[i] = (-1) ** i / 2 else: w[i] = (-1) ** i cgl = -cos(arange(N) * pi / (N - 1)) CGL = ones(N) fc = ones(N) for i in range(N): CGL[i] = (pi / 4) * cgl[i] + (pi / 4) fc[i] = sin(CGL[i]) x1 = ones(M) y = zeros(M) er = zeros(M) s = 1 for i in range(0, M): numerator = 0 denominator = 0 x1[i] = (x[i]) % (2 * pi) s = 1 if x1[i] > pi: x1[i] = 2 * pi - x1[i] s = -1 if x1[i] > (pi / 2): x1[i] = pi - x1[i] for j in range(N): temp = w[j] / (x1[i] - CGL[j]) numerator += temp * fc[j] denominator += temp y[i] = s * numerator / denominator for i in range(0, M): for k in range(N): if abs(x1[i] - CGL[k]) == 0: y[i] = fc[k] er[i] = abs(y[i] - sin(x[i])) mer = norm(er, inf) return mer
What is the asymptotic analysis of the algorithm for 2.1 f(n) = log x + n² + 14n + 15 is f(n) in O(n²), O(n³), 2(n²), Q(n), O(n² ), O(n), Q(n³), O(n), or ©(n³ ). 2.2 f(n) = 45x³ + 15x2 + 26x + 10 is f(n) in O(n?), O(n³), Q(n²), Q(n), O(n² ), 0(n), Q(n³), O(n), or 0(n³ )
The given time complexity is: m T(m-1) + ca > 1 cb = 0 expanding using substitution: m T(m-1) + ca m[(m-1) T(m-2) + ca]+ ca m(m-1) T(m-2) + mca + ca m(m-1) [(m-2) T(m-3) + ca] + mca + ca m(m-1)(m-2) T(m-3) + m(m-1)ca + mca + ca what is the time complexity? form an expression for adding all the ca
GIVEN THE FOLLOWING CODE SNIPPET: def foo(a, b=[1]): if a <= 1: return b b_new = [b[i] + b[i+1] for i in range(len(b)-1)] return foo(a-1, [1] + b_new + [1]) 1.1 What is the worst-case time complexity of foo(a,b) assuming initial b=[1]? HINT: THE ANSWER IS NOT O(1), O(n^2), O(a), O(log b), O(n), O(b^2). 1.2 What is the worst-case auxiliary space complexity of foo(a,b) assuming initial b=[1]? HINT: THE ANSWER IS NOT O(1), O(n^2), O(a), O(log b), O(n), O(b^2).
Given a collection of numbers that might contain duplicates,return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1]]""" def permute_unique(nums): perms = [[]] for n in nums: new_perms = [] for l in perms: for i in range(len(l)+1): new_perms.append(l[:i]+[n]+l[i:]).
I'm trying to understand how both of these algorithms, separated by a) and b), have a time complexity of O(n), could you explain how this is? a)int i = 0;while (i < n) { ... i++;}for(int j = 3; j < n * n; j += n) { ...}int k = 1;while (k < n) { ... k *= 2;} b)for(int i = 1; i < n; i += 3) { for(int j = 3; j < 10; j++) { for(int k = 5; k < n; k += n) { ... } }}
(i) Consider the following code: int myFunc(int A[], int n) { int i, j, max = 0; int msis[n]; for ( i = 0; i < n; i++ ) msis[i] = A[i]; for ( i = 1; i < n; i++ ) for ( j = 0; j < i; j++ ) if (A[i] > A[j] && msis[i] < msis[j] + A[i]) msis[i] = msis[j] + A[i]; for ( i = 0; i < n; i++ ) if ( max < msis[i] ) max = msis[i]; return max; } What is the time complexity of the algorithm? Consider the following array values and apply quick sort on it. Only dry run is required but you have to show all steps 10 3 8 5 12 2 15 4 1
The time complexity equation of merger-sort is T(n) = 2* T(n/2) + n, where T(1) = C and C is a constant. Solve this equation by giving detailed steps. If you have an equation like the following T(n) = 3* T(n/3) + n, where T(1)=T(2)=C, what would be T(n)?
Correct answer will be upvoted else downvoted. Computer science. Allow us to signify by d(n) the amount of all divisors of the number n, for example d(n)=∑k|nk. For instance, d(1)=1, d(4)=1+2+4=7, d(6)=1+2+3+6=12. For a given number c, track down the base n to such an extent that d(n)=c. Input The principal line contains one integer t (1≤t≤104). Then, at that point, t experiments follow. Each experiment is characterized by one integer c (1≤c≤107). Output For each experiment, output: "- 1" in case there is no such n that d(n)=c; n, in any case.
Let s = σ1. . . σk be a binary string of length k > 0. We say that a binary string w = w1 . . . wn contains s as a subsequence if there are k indices 1 ≤ i1 < i2, . . . < ik ≤ n such that wik = sr for every 1 ≤ r ≤ k. For example, if s = 11 then 10001, 1010 and 110 contain s as a subsequence whereas 000 and 1000 do not. Prove that the language of all binary strings containing a fixed binary string s of length k as a subsequence is a regular language.
Suppose T(n) is the time to execute an algorithm with input size n. Which of the following algorithms with the T(n) show is not good to be solved by divide-and-conquer? (Choose the best answer) A. T(n) = 2T(n/2) + 2nB. T(n) = 10T(n/10) + 10nC. T(n) = 2T(n/2) + 2n2D. T(n) = 2T(n/2) + 100n10E. T(n) = T(n-1) + 2T(n-2)