Design and Analysis of Algorithms Consider the following description of a recursive algorithm: “The algorithm splits the input in three equal parts in constant time, process each part recursively and finally combines the solution in linear time”. Formulate a recurrence and solve it to compute total execution time of the algorithm. (Note: You can use any method for solving the recurrence.)

Design and Analysis of Algorithms Consider the following description of a recursive algorithm: “The algorithm splits the input in three equal parts in constant time, process each part recursively and finally combines the solution in linear time”. Formulate a recurrence and solve it to compute total execution time of the algorithm. (Note: You can use any method for solving the recurrence.)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section: Chapter Questions

Problem 10PP

See similar textbooks

Similar questions

Algorithm problem w/ recurrence: Frying pancakes: a small pan can only hold two pancakes at a time. Each pancake needs to be fried on both sides. Frying one side takes 1 minute, no matter how many pancakes are on the pan. Consider this recursive algorithm: If n <= 2, fry the pancakes or the two pancakes together on each side. If n > 2, fry any two pancakes together on each side and then apply the same process recursively to the remaining n-2 pancakes. a. Set up and solve the recurrence for the amount of time this algorithm needs to fry n pancakes. b. Explain why this algorithm does not fry the pancakes in the minimum time for all n > 0. c. Give a correct recursive algorithm that executes the task in the minimum amount of time. > I was not sure how to start this. I have had trouble with recurrence in the past. Also from the work that I did do, I didn't know how there could be a better algorithm. Thanks in advance
Backtracking normally uses ______ to find out all solutions to a computational problem. (recursion, iteration).
Python Using recursion only No loops Note that in a correct solution the isdigit method or in operator will never be applied to the entire string s. The function must return and not print the resulting string. def getDigits(s):
Nuts and bolts You are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to its nut. Design an algorithm for this problem with average-case efficiency in (n log n).
Calculating Fibonacci number: Write down the pseudocode for originally calculating Fibonacci number (without using dynamic programming) Write down the pseudocode for originally calculating Fibonacci number using dynamic programming, iteratively Write down the pseudocode for originally calculating Fibonacci number using dynamic programming, recursively What’s the difference between these three?
Memoization technique is one of the popular techniques that improve the performance of the recursive algorithms. When applied to a recursive problem how does it affect overall performance? Time complexity decreases and the space complexity increases Time complexity decreases and the space complexity decreases Time complexity increases and the space complexity decreases Time complexity increases and the space complexity increases
Force Completion This test can be saved and resumed at any point until time has expired. The timer will continue to run if you leave the te Your answers are saved automatically. >Show Timer * Question Completion Status: QUESTION 1 Experience has shown that the best way to construct a program is from small pieces. This is called O bottom up O the whole is greater than the sum of the parts O divide and conquer O recursion approach. Click Save and Submit to save and submit. Click Save All Answers to save all answers. 25
Question 4 - Algorithm Design Imagine you are a treasure hunter standing at one side of the river. There are n (a positive integer) stones on the river. They are aligned on a straight line and at the nth stone, there is treasure waiting for you. Your target is to reach the nth stone. For each move, you have the choice of either walking (move one stone ahead) or leaping (move two stones ahead). Also, you are not allowed to travel backwards. Design an algorithm that calculates the number of ways (sequences of walks/leaps) that get you to the treasure stone. You should clearly explain the algorithm and demonstrate the correctness of the algorithm with a complete proof. Here is an example. For n = 1 5, there are 8 ways: Method 1: walk → walk → walk → walk → walk Method 2: walk → walk → walk → leap Method 3: walk → walk → leap → walk Method 4: walk → leap → walk → walk walk Method 5: leap → walk → walk → Method 6: leap → leap walk Method 7: leap → walk → leap Method 8: walk → leap leap
Decrease-by-Constant-Factor Fake-Coin puzzle method in Java or C++ to find the fake coin out of n coins. Assume the false coin is lighter. Randomly place the false coin among the n coins. Submit results images and code files.
Internal iteration example
Question-3 There are n number of students in a class. Assume a teacher enters and wants to shake hand according to an algorithm: Algorithm (X) à 2n a) Write a recursive function to solve this problem for any number of students also calculate the time complexity of your code, along with an idea what might be the best technique to solve this problem other than recursion. b) Consider this Algorithm-Z , Taking list of integer as input List Of Integer: X(Integer: number) List Of Integer: Y Integer: i = 2 While (i < number) While (number Mod i == 0) Y.Add(i) number = number / i End While i = i + 1 End While If (number > 1) Then Y.Add(number) Return Y End X (i) Explain what Algorithm Z is doing? (ii) Analyze the complexity of Algo-Z and then write an algorithm Better-Algo-X that does exactly the same thing but with a strictly better time complexity
Question-3 There are n number of students in a class.Assume a teacher enters and wants to shake hand according to an algorithm: Algorithm (X) à 2n a) Write a recursive function to solve this problem for any number of students also calculate the time complexity of your code, along with an idea what might be the best technique to solve this problem other than recursion. b) Consider this Algorithm-Z , Taking list of integer as input List Of Integer: X(Integer: number) List Of Integer: Y Integer: i = 2 While (i< number) While (number Mod i == 0) Y.Add(i) number = number / i End While i = i + 1 End While If (number > 1) Then Y.Add(number) Return Y End X (i) Explain what Algorithm Z is doing? (ii) Analyze the complexity of Algo-Z and then write an algorithm Better-Algo-X that does exactly the same thing but with a strictly better time complexity