How many lines does his algorithm print? Write a recurrence and solve it.function printaton(n: an integer power of 2) { if n > 1 { printaton(n/2) printaton(n/2) printaton(n/2) for i = 1 to n ^ 4 do printline("are we done yet?") }} a. Use Master's theorem to obtain an asymptotic solution. b. Derive an exact solution by expanding the recurrence.

How many lines does his algorithm print? Write a recurrence and solve it.function printaton(n: an integer power of 2) { if n > 1 { printaton(n/2) printaton(n/2) printaton(n/2) for i = 1 to n ^ 4 do printline("are we done yet?") }} a. Use Master's theorem to obtain an asymptotic solution. b. Derive an exact solution by expanding the recurrence.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

Suppose that, in a divide-and-conquer algorithm, we always divide aninstance of size n of a problem into 10 subinstances of size n/3, and thedividing and combining steps take a time in Θ(n2) in n>1, and it performs one basic operation if n = 1. Write a recurrenceequation for the running time of T(n), and solve the equation.
(a) For each of the following recurrences, give an expression for theruntime T (n) if the recurrence can be solved with the Master Theorem.Otherwise, indicate that the Master Theorem does not apply.(i) T (n) = T (n/2) + T(n/2) + T(n/2) + n2(ii) T (n) = 0.5T (n/2)+ 1/n(iii) T (n) = 3T (n/3) + n(iv) T (n) = 4T (n/2) + nlogn
Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into 10 sub-instances of size n=3, and the dividing and combining steps take a time in O(n2). Write a recurrence equation for the running time T (n), and solve the equation for T (n).
Lets say an algorithm has 2 base cases. PsuedoCode: if n == 1 return 0 if n == 2 return 1 return A[n..............n-1]solve the recurrence relation for the above simple recursive algorithm?
Use divide-and-conquer algorithm for finding the position of the maximum element in an array of n numbers. Set up a recurrence relation for the above algorithm and solve it.
Find the order of growth for solutions of the following recurrences using master theorem. 1. T(n) = 4T(n/2) + n, T(1) = 1 2. T(n) = 4T(n/2) + n^2, T(1) = 1 3. T(n) = 4T(n/2) + n^3, T(1) = 1
Given a set of n numbers, we wish to find the i largest in sorted order using a comparison-based algorithm. Find the algorithm that implements each of the following methods with the best asymptotic worst-case running time, and analyze the running times of the algorithms in terms of n and i. a. Sort the numbers, and list the i largest. Group of answer choices 1. O(ni) 2. O(nlg(n)) 3. O(n + ilg(n)) 4. O(i + nlg(n)) 5. O(n + ilg(i)) b. Build a max-priority queue from the numbers, and call EXTRACT-MAX i times. Group of answer choices 1. O(i + nlg(n)) 2. O(n + ilg(n)) 3. O(nlg(n)) 4. O(ni) 5. O(n + ilg(i)) c. Use an order-statistic algorithm to find the ith largest number, partition around that number, and sort the i largest numbers. Group of answer choices 1. O(n + ilg(i)) 2. O(n + ilg(n)) 3. O(nlg(n)) 4. O(i + nlg(n)) 5. O(ni)
Solve recurrence with backward substitution. G(1) = 11 G(n) = 5 + G(n/2)
You are given an array of positive integers S[1, . . . , n]. You are initially positioned at the array’s first index 1, and each element S[i] represents your maximum length of jump at position i. For example, you can jump from position i to any position among i + 1, . . . , i + S[i]. Return true if you can reach the last index, or false otherwise. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.
De ning T(0) = a; T(1) = b; T(2) = c, and T(n + 3) = (1=3)(T(n + 2) + T(n + 1) + T(n)) for n >= 0, solve for the limit T(n) as n -> ∞. Show your work.
Use the divide and conquer strategy to understand the binary search for a sorted list of n elements. Let T(n) denote the time complexity function for the binary search. Derive a recurrence relation for T(n) and solve for T(n) to get a close form expression.
The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm. Algorithm Euclid(a,b)Require: a, b ≥ 0Ensure: a = GCD(a, b) while b ̸= 0 do t ← b b ← a mod b a ← tend whilereturn a We want to estimate its worst case running time using the big-Oh notation. Answer the following questions: a. Let x be a integer stored on n bits. How many bits will you need to store x/2? b. We note that if a ≥ b, then a mod b < a/2. Assume the values of the input integers a and b are encoded on n bits. How many bits will be used to store the values of a and b at the next iteration of the While loop? c. Deduce from this observation, the maximal number iterations of the While loop the algorithm will do.