Examples: addOdd(1) -> 1 addOdd(2) -> 1 addOdd(3) -> 4 addOdd(7) -> 16   public int addOdd(int n) {   if (n <= 0) {     return 0;   }   if (n % 2 != 0) { // Odd value     return <>   } else { // Even value     return addOdd(n - 1);   } }

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 6PE
icon
Related questions
Question

For function addOdd(n) write the missing recursive call. This function should return the sum of all postive odd numbers less than or equal to n.

Examples:

addOdd(1) -> 1
addOdd(2) -> 1
addOdd(3) -> 4
addOdd(7) -> 16

 

public int addOdd(int n) {
  if (n <= 0) {
    return 0;
  }
  if (n % 2 != 0) { // Odd value
    return <<Missing a Recursive call>>
  } else { // Even value
    return addOdd(n - 1);
  }
}

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Unreferenced Objects
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar 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