Write a recursive, int-valued method named productofodds that accepts an integer array, and the number of elements in the array and returns the product of the positive odd-valued elements of the array. You may assume the array has at least one positive odd-valued element. The product of t he odd-valued elements of an integer-valued array recursively may be calculated as follows: • If the array has a single element and it is odd, return the value of that element; otherwise return 1. • Otherwise, if the first element of the array is odd, return the product of that element and the result of finding the product of the odd elements of the rest of the array; ir the first element is NOT odd, simply return the result of finding the product of the odd elements of the rest of the array

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

***JAVA***

 
Write a recursive, int-valued method named productofodds that accepts an integer array, and the number of elements in the array and returns the product of the positive odd-valued elements of the array. You may assume the array has at least one positive odd-valued element. The product of t
he odd-valued elements of an integer-valued array recursively may be calculated as follows:
• If the array has a single element and it is odd, return the value of that element; otherwise return 1.
• Otherwise, if the first element of the array is odd, return the product of that element and the result of finding the product of the odd elements of the rest of the array; if the first element is NOT odd, simply return the result of finding the product of the odd elements of the rest of the array
Transcribed Image Text:Write a recursive, int-valued method named productofodds that accepts an integer array, and the number of elements in the array and returns the product of the positive odd-valued elements of the array. You may assume the array has at least one positive odd-valued element. The product of t he odd-valued elements of an integer-valued array recursively may be calculated as follows: • If the array has a single element and it is odd, return the value of that element; otherwise return 1. • Otherwise, if the first element of the array is odd, return the product of that element and the result of finding the product of the odd elements of the rest of the array; if the first element is NOT odd, simply return the result of finding the product of the odd elements of the rest of the array
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY