Answer :
Answer:
Recursive algorithms call itself with simpler or smaller input values. They can be used to solve large problems by using the solutions to minor parts of the problem, these minor problems are then further broken down to solvable cases.
Given the input as a sequence;
max([tex]z_{1}, z_{2}, ... z_{k}: integers)[/tex]
if [tex]k=1[/tex] return [tex]z_{1}[/tex]
else
[tex]c=max(z_{1}, z_{2},...z_{k-1})[/tex]
if [tex]c[/tex] > [tex]z_{1}[/tex] return [tex]c[/tex]
else return [tex]z_{1}[/tex]
The procedure for finding recursive algorithm for maximum of a finite set of integers is given in the solution procedure.
- Recursive Algorithm-Recursive Algorithm is an algorithm which calls itself a smaller or simpler input values and return the value of the given input by performing all the basic operation on it to make it simpler and smaller.
Now in an finite set of integers has both maximum and minimum values. When a algorithm largest and its input is a set of finite set of integers let,
[tex]a_1, a_2, a_3, a_4 .......[/tex][tex]a_n[/tex]
Recursive algorithm for finding the maximum of a finite set of integer-
Get the array for which the maximum is to be found . Recursively find the maximum according to the following:
Recursively traverse the array from the end.
If the remaining array is of length [tex]n=1[/tex] , return the only present element [tex]a_1[/tex].
else,
[tex]c=max(a_1, a_2, a_3, a_4 .......)[/tex]
If [tex]c>a_1[/tex]
return [tex]c[/tex]
else return [tex]a_1[/tex]
Hence, the procedure for finding recursive algorithm for maximum of a finite set of integers is given in the solution procedure.
For more about the algorithm, find the given link below-
https://brainly.com/question/22952967