a) Write a non-recursive function in C++/ to multiply all even numbers from 2 to n, where n is an input to the function, and n>=2. (reminder: An even number is divisible by 2 and generates a remainder of 0. for example 2,4,6,... are even numbers). b) Analyze your algorithm in part (a) in the worst-case. Show all your work. Then express the time as Big-O().

a) Write a non-recursive function in C++/ to multiply all even numbers from 2 to n, where n is an input to the function, and n>=2. (reminder: An even number is divisible by 2 and generates a remainder of 0. for example 2,4,6,... are even numbers). b) Analyze your algorithm in part (a) in the worst-case. Show all your work. Then express the time as Big-O().

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 7SA

See similar textbooks

Similar questions

Need some help with this c++ problem In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 211 and you know that 210 = 1024, then 211 = 2 × 1024 = 2048. Based on this observation, write a recursive function int pow2(int n) where n is the exponent. If the exponent is negative, return -1. int pow2(int n) { ..... }
Note: Solve using c++ Write a recursive function to get count of a specific character in given string or array ofcharacters.Prototype of Function: int getCharCount(const char* ptr, char c)Input: const char* ptr=” wavelength”, char c=’e’Output: 2 (as ‘e’ occurs two times in the “wavelength”)
for C++ write a progam for the greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows. If y is 0 the answer is x; otherwise gcd(x, y) is gcd(y, x%y).
Implement a recursive C++ function which takes a character (ch) and a positive integer (n) and prints thecharacter ch, n times on the screen. The prototype of your function should be:void printChar (char ch, int n)For example, calling printChar('*',5) should display ***** on screen.Note: There should NOT be any loop in your function.
Write a recursive C++ program to find the GCD of two numbers and using this write a function to find the L.C.M of two numbers in O(1) time. GCD function should contain one line of code. Please answer only if you can fulfill the conditions else I will downvote.
IN C++, with pre an d post pseudocode please Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper…
Write a recursive function to compute the following series:
I need help in this practice problem of C (notC++ or C#) without using strings or arrays. Write a recursive function on the following formulas and problems a(n)=a(n-1)+1 where a(1)=1 b(x)=b(x-1)*b where b(1)=1 f(n, m)=f(n-1, m+1) +f(n-2, m+1)+m where f(1, m)=1 and f(0, m)=0
Write a Recursive Function to print number from Given input down to 0?
Find the logic error(s) in the following recursive function, and explain how to correct them. This function should find the sum of the values from 0 to n. def sum(n): if n == 0: return 0 Else: Return n + sum(n)
Please IN C++ Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper function (IsPrimeRecur) which…
Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the following property, which holds for positive integers p and q: If p > q, the gcd of p and q is the same as the gcd of q and p % q.