Answered: This function uses a curious mix of… | bartleby

C++ Programming: From Problem Analysis to Program Design

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

Related questions

Question

explain l

This function uses a curious mix of iteration and recursion:
function F(n)
if n < 1
t<- O
return 1
for i <- 0 to n
for j <- i to n
t<- t + j
return t + F(n-1)
The number of basic operations (additions and subtractions)
performed is:
○
Ⓒ (n)
℗ (n²)
Ⓒ (n² log n)
Ⓒ (n³)
Ꮎ
Ⓒ (n4)

AI-Generated Solution

AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.

Unlock instant AI solutions

Tap the button
to generate a solution

Click the button to generate
a solution

Similar questions

The following function f uses recursion:def f(n):if n <= 1return nelsereturn f(n-1) + f(n-2)5Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion? a) def f(n):a <- 0b <- 1if n = 0return aelsif n = 1return belsefor i in 1..nc <- a + ba <- bb <- creturn b b) def f(n):a <- 0i <- nwhile i > 0a <- a + i + (i-1)return a c) def f(n):arr[0] <- 0arr[1] <- 1if n <= 1return arr[n]elsefor i in 2..narr[i] <- arr[i-1] + arr[i-2]return arr[n] d) def f(n):arr[0..n] <- [0, ..., n]if n <= 1return arr[n]elsea <- 0for i in 0..na <- a + arr[i]return a
For funX |C Solved xb Answer x+ CodeW X https://codeworko... 田) CodeWorkout X267: Recursion Programming Exercise: Cumulative Sum For function sumtok, write the missing recursive call. This function returns the sum of the values from1 to k. Examples: sumtok(5) -> 15 Your Answer: 1 public int sumtok(int k) { 2. } (0 => ) return 0; 3. } else { return > 6. { Check my answer! Reset Next exercise 1:09 AM
The following function f uses recursion:def f(n):if n <= 1return nelse return f(n-1) + f(n-2)Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion?a) def f(n):a <- 0b <- 1 if n = 0return aelsif n = 1 return belsefor i in 1..nc <- a + b a <- b b <- c return bb) def f(n):a <- 0i <- n while i > 0 a <- a + i + (i-1) return ac) def f(n): arr[0] <- 0 arr[1] <- 1 if n <= 1return arr[n]elsefor i in 2..n arr[i] <- arr[i-1] + arr[i-2]return arr[n]d) def f(n): arr[0..n] <- [0, ..., n] if n <= 1return arr[n]elsea <- 0 for i in 0..n a <- a + arr[i]return a
Using C Write a recursive function find_sum that calculates the sum of successive integers starting at 1 andending at n (i.e., find_sum(n) = (1 + 2 +. . . + ( n − 1) +n ).You have to use recursive function to solve this problem.
What does the following recursive function do? int f(int n)X if (n==1) return 1; else return n+f(n-1); } Sum of numbers from 1 to n Factorial of number n Square of numbers from 1 to n Print the numbers from 1 to n
The following function f uses recursion: def f(n): if n <= 1 return n else return f(n-1) + f(n-2) 5 Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion? a) def f(n): a <- 0 b <- 1 if n = 0 return a elsif n = 1 return b else for i in 1..n c <- a + b a <- b b <- c return b f(n): a <- 0 i <- n while i > 0 a <- a + i + (i-1) return a f(n): arr[0] <- 0 arr[1] <- 1 if n <= 1 return arr[n] else for i in 2..n arr[i] <- arr[i-1] + arr[i-2] return arr[n] f(n): arr[0..n] <- [0, ..., n] if n <= 1 return arr[n] else a <- 0 for i in 0..n a <- a + arr[i] return a
Write a recursive function to compute the following series:
Write a recursive function that returns the nth Fibonacci number from the Fibonacciseries.int fib(int n);
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
Ackermann’s function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a function A(m, n) that solves Ackermann’s function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return A(m-1, 1) Otherwise, return A(m-1, A(m, n-1)) Test your function in a driver program that displays the following values:A(0, 0) A(0, 1) A(1, 1) A(1, 2) A(1, 3) A(2, 2) A(3, 2)
1. a) Given a recursive algorithm as below: int F(int n) { if (n <= 1) return 1; else if (n % 2 == 0) return F(n-1) + n; else return F(n/2) - 1; } Illustrate how you will find out the value of F(10) using the above algorithm. You need to show all the steps. b) Given a function as below: int recFx(int a, int b) { If (a < b) return a +b; else return recFx(a - b, b + 1); } Determine the values of: recFx(-10, 8) recFx(148, 78) (11) Must show all the steps.
8. Ackerman's Function Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann's function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return ackermann(m-1,1) Otherwise, return ackermann(m-1,ackermann(m,n-1)) Once you've designed yyour function, test it by calling it with small values for m and n. Use Python.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS