R-5.2: Explain how to modify the recursive binary search algorithm so that it returns the index...

Transcribed Image Text:

R-5.2: Explain how to modify the recursive binary search algorithm so that it returns the index of the target in the sequence or -1 (if the target not found). You would need to first change Boolean with a int, false with a -1 and true with mid. R-5.3: Draw the recursion trace for the computation of power (2,5), using the traditional algorithm implemented in Code Fragment 5.8. return 32 Power (2,5) return 16 Power (34) return 8 8 Power (2,3) return 4. Power (2,2) Power (21) Power (20) return 2 Dreturn 1 return 1 C-5.13: Give a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction. public static int multiply(int m, int n) { } if(m 0) return (m + multiply(m, n - 1)); else return 0; C-5.18 (For 5.18, you do not need to turn in a working Java source file. Just write out the method.): Write a short recursive Java method that determines if a string s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'gohangasalamiimalasagnahog'. public static boolean palindrome(String str) { if(str.length() == 0 || str.length() == 1) return true; if(str.charAt(0) == str.charAt(str.length() - 1)) return palindrome (str.substring(1, str.length() - 1)); return false; } R-5.2: Explain how to modify the recursive binary search algorithm so that it returns the index of the target in the sequence or -1 (if the target not found). You would need to first change Boolean with a int, false with a -1 and true with mid. R-5.3: Draw the recursion trace for the computation of power (2,5), using the traditional algorithm implemented in Code Fragment 5.8. return 32 Power (2,5) return 16 Power (34) return 8 8 Power (2,3) return 4. Power (2,2) Power (21) Power (20) return 2 Dreturn 1 return 1 C-5.13: Give a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction. public static int multiply(int m, int n) { } if(m 0) return (m + multiply(m, n - 1)); else return 0; C-5.18 (For 5.18, you do not need to turn in a working Java source file. Just write out the method.): Write a short recursive Java method that determines if a string s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'gohangasalamiimalasagnahog'. public static boolean palindrome(String str) { if(str.length() == 0 || str.length() == 1) return true; if(str.charAt(0) == str.charAt(str.length() - 1)) return palindrome (str.substring(1, str.length() - 1)); return false; }