Hi! I have a homework assignment in my Data Structures Course using Java and I’m

Question

Hi! I have a homework assignment in my Data Structures Course using Java and I’m having trouble on a couple problems. Could someone help me on #11 (a-f) and #13. Thank you!!!
base case, reduced problem, and general solution of the recursive algorithm for: Give a. n! b. e The product of two integers a and b. The sum of the integers from a to b, a> b. Outputting an array of characters, c, given the starting and ending indices. d. f. Binary search of an array to locate the value akey. 12. Give the signatures of the methods that implement the recursive algorithms of Exercises 13, Give the pseudocode of the methods that implement the recursive algorithms of Exercises 11(a) through 11(f).

Explanation / Answer

All the answers are provides , base case, reduced problem , Psudo Code and general solution is provided
Read and let me know if there is any doubts

int factorial (int n){
//Base Case

if n==0   
return 1;
//Reduced problem
return n*factorial(n-1);

}
======================================================================

int power(int x, int y){

//Base Case

if y==0   
return 1;
if y==1   
return x;
//Reduced problem
return x*power(x, y-1);

}
=========================================================================================

}

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.