a) Devise a recursive algorithm to nd a2n , where the inputs to the algorithm consist of a which is a real number and n which is a positive integer. Hint: Use the equality a2n+1 = (a2n )2. (b) Assume that you are not allowed to use any function for computing the powers. Devise an iterative algorithm for solving the same problem. (c) Analyze the running times of the two approaches.

a) Devise a recursive algorithm to nd a2n , where the inputs to the algorithm consist of a which is a real number and n which is a positive integer. Hint: Use the equality a2n+1 = (a2n )2. (b) Assume that you are not allowed to use any function for computing the powers. Devise an iterative algorithm for solving the same problem. (c) Analyze the running times of the two approaches.

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

The function below has the recursive relation T(x,y) = 2T(y/2)+O(1) when x,y>0Knowing these information, find the following: 1) The worst-case time complexity of the function2) The worst-case auxiliary space complexity of the function3) Explanation as to how the time complexity of the function can be improved without using multiplication operations.
Answer the question please?What is the return value of the following recursive algorithm when the input arguments are A=[0,0,1,0,0,1,0,1] and pos=7? function F(A,pos)if(pos<0) return 0 if(pos==length(A)-1 or pos==0 or A[pos-1]==1 or A[pos+1]==1) return 0 + F(A,pos-1) if(A[pos-1]==0 and A[pos+1]==0) return 1+ F(A,pos-1) One of these options below are correct, which one? 7 2 8 5 none of the others
Answer the given question with a proper explanation and step-by-step solution. Write the provided sequence as a recursive function. 1,2,4,8,16,32,dots
Differentiate between Recursion and Iteration and when to use them. (b) Give two (2) examples of problems that can be solved using Recursion.
Exercise 2. Give a recursive definition for the factorial operation k! n! for n ≥ 1. (remember that 1! = 0! = 1) Provide an algorithm in pseudo code to evaluate k! n! as one function Provide an algorithm in pseudo code to evaluate k! n! as three functions Evaluate the complexity of the algorithm at point 2 Evaluate the complexity of the algorithm at point 3
Recursive form given below Find the open form of the T n () function and write down the Big-Oh complexity.
Answer the given question with a proper explanation and step-by-step solution. C++ 11.12 LAB: Fibonacci sequence (recursion) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use recursion and DO NOT use any loops. main.cpp #include <iostream>using namespace std; int Fibonacci(int n) {/* Type your code here. */ } int main() {int startNum;cin >> startNum;cout << "Fibonacci(" << startNum << ") is " << Fibonacci(startNum) << endl;return 0;}
For the sequence 21, 18, 15, 12, 9, ....:(i) Find recursive and non-recursive formulas.(ii) Prove the non-recursive formula using recursive formula and by induction.(iii) Write and iterative algorithm to out put the first m terms.
Assume that for each number I n is not 2. How could the algorithm be modified to handle the situation where n is odd? I have two approaches: one that directly adjusts the recursive method and the other that mixes the iterative and recursive approaches. Just one of the two tasks must be completed (as long as it works and does not increase the BigOh of the running time.)
Solve it with Python language For doing the lab activity: 1) Apply Recursive function technique to solve Problem 1 and 2. (Do not use iterative method) 1.Evaluate Binomial Coefficient. nCr=n! / (r! *(n-r)!) 2. Fibonacci Numbers (Sequence): 0, 1, 1, 2, 3, 5, 8 …
Q1. (A) Draw a solution algorithm (at the same time) to find the maximum and minimum values of n matrix elements, and input the pseudo code. (B) The number of comparisons between the algorithms is recursively related and solved by assuming n=2k . © How to compare this algorithm with a simple algorithm to solve the same problem?
The recursive Fibonacci function is inefficient becausea) it does many repeated computationsb) recursion is inherently inefficient compared to iterationc) calculating Fibonacci numbers is intractabled) fibbing is morally wrong