Find the complexity of the following blocks of code or algorithm’s description. [Note: your answer must show the steps that lead to your final answer] 1) The algorithm solves the problem of size n by recursively solving subproblems of size n – 1, and then combining the solutions in constant time. 2) The algorithm solves the problem by breaking it into 16 subproblems of 1/4 the scale, recursively solving each submaze, and then combining the solutions in linear time 3) The algorithm solves the problem of size n by dividing it into 32 subproblems of size n/2, recursively solving each sub-problem, and then combining the solutions in O(n5 ) time

Find the complexity of the following blocks of code or algorithm’s description. [Note: your answer must show the steps that lead to your final answer] 1) The algorithm solves the problem of size n by recursively solving subproblems of size n – 1, and then combining the solutions in constant time. 2) The algorithm solves the problem by breaking it into 16 subproblems of 1/4 the scale, recursively solving each submaze, and then combining the solutions in linear time 3) The algorithm solves the problem of size n by dividing it into 32 subproblems of size n/2, recursively solving each sub-problem, and then combining the solutions in O(n5 ) time

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 17PE

See similar textbooks

Similar questions

Use back substitution method to compute the following recursive function. Note that final results must be presented as a function of n. Show at least three substitutions before moving to k steps to get credit.
Need python help. For problems 1 and 2, add your code to the file Lab2.java. Add your tests in the main function of Lab2.java. Do not use static variables in class Lab2 to implement recursive methods. Problem 1: Implement a recursive method min that accepts an array and returns the minimum element in the array. The recursive step should divide the array into two halves and find the minimum in each half. The program should run in O(n) time and consume O(logn) memory. Demonstrate the output of min on the array int [] a = { 2, 3, 5, 7, 11, 13, 17, 19, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 23, 29, 31, 37, 41, 43 } Problem 2 You have been offered a job that pays as follows: On the first day, you are paid 1 cent, on the second day, 2 cents, on the third day, 4 cents and so on. In other words, your pay doubles every day. Write a recursive method computePay that for a given day number computes the pay in cents. Assume that you accumulate all the money that you are paid. Write a…
Use the recursion to solve the following problems 1. Calculate the sum of an array of n integers. 2. Compute Powers, p(x,n)=xn 3. Revers an array of n integers 4. Calculate the length of string (number of characters) 5. Implement the tail recursion for problems 1 and 2. Please test the program by using 2 different input sets!
The first examples of recursion are the mathematical functions factorial and fibonacci. These functions are defined for non-negative integers using the following recursive formulas:factorial(0) = 1factorial(N) = N*factorial(N-1) for N > 0fibonacci(0) = 1fibonacci(1) = 1fibonacci(N) = fibonacci(N-1) + fibonacci(N-2) for N > 1Write recursive functions to compute factorial(N) and fibonacci(N) for a given non-negative integer N, and write a main() routine to test your functions.(In fact, factorial and fibonacci are really not very good examples of recursion, since the most natural way to compute them is to use simple for loops. Furthermore, fibonacci is a particularly bad example, since the natural recursive approach to computing this function is extremely inefficient.)
ORIGINAL SOLUTIONS ONLY PLEASE. For this computer algorithms problem, you are given an N amount of cents, Then you are being asked to break the cents up into smaller coins of either 1,2 or 5 cents. IN PSUDOCODE Not real COde, you must construct a dynamic-programming-based recursive algorithm returning the smallest amount of coins needed to solve the problem. IN example if you get N=15 then in return you would get A(15) returns 3 because 5 + 5 + 5 = 15.
Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?
Write a recursive function to implement the recursive algorithm (determining the number of ways to select a set of things from a given set of things). Also, write a program to test your function.
Recursion and Big O Examine the pseudocode below. (Recall that integer division rounds down any fractional valuesto the nearest whole number and that % is the modulus operator which returns the remainder afterdoing integer division.)Algorithm RecursiveFunction(n) // n is an integerif (n > 0)RecursiveFunction(n/2)PrintOut(n%2)endifA. What is the output of this algorithm if it is initially called with 10 for n? Explain how youarrived at that answer; that is, show your work, including the call stack for the execution of hisfunction at each step.
Let A[1...n,1...n] be a 2D array of positive integers with n rows and n columns. Let ArraySum(a,b,c,d) be the sum of all the elements of A[a...b, c...d] (i.e., the submatrix of A with rows a to b and columns c to d). Write down a recursive formula for ArraySum(a,b,c,d) and analyze the time complexity of the corresponding recursive algorithm. You must write a formal recursive formula including the base case and general recursive step.
The Tower of Hanoi is a puzzle where n disks of different sizes arestacked in ascending order on one rod and there are two other rods with nodisks on them. The objective is to move all disks from the first rod to thethird, such that:- only one disk is moved at a time- a larger disk can never be placed on top of a smaller oneWrite a recursive function that outputs the sequence of steps needed tosolve the puzzle with n disks.Write a test program in C++ that allows the user to input number of disks andthen uses your function to output the steps needed to solve the puzzle.Hint: If you could move up n−1 of the disks from the first post to thethird post using the second post as a spare, the last disk could be moved fromthe first post to the second post. Then by using the same technique you canmove the n−1 disks from the third post to the second post, using the firstdisk as a spare. There! You have the puzzle solved. You only have to decidewhat the nonrecursive case is, what the recursive…
Write a recursive function to implement the recursive algorithm (multiplying two positive integers using repeated addition). Also, write a program to test your function.
Artificial Intelligence (Part - 1) ==================== The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (1) Propose a state representation for the problem?