Recursive Design
Design a recursive algorithm to solve the following problem. Do not write any code.
Find the largestand smallestnumbers in an array of integers.
Hint: If the list has two numbers then the smallest is the smaller and the largest is the larger. Otherwise, ask your friend to consider all the numbers in the list except the first two, and determine the smallest and largest in the shortened list. You take it from there using three if statements.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.