Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

class Star { public static int findMinRec ( int A [ ] , int n ) { if ( n = = 1 ) return

class Star
{
public static int findMinRec(int A[], int n)
{
if(n ==1)
return A[0];
return Math.min(A[n-1], findMinRec(A, n-1));
}
public static int findMaxRec(int A[], int n)
{
if(n ==1)
return A[0];
return Math.max(A[n-1], findMaxRec(A, n-1));
}
public static void main(String args[])
{
int A[]={1,4,45,6,-50,10,2};
int n = A.length;
System.out.println("Original Array is :");
for(int i =0 ; i

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Professional Microsoft SQL Server 2012 Administration

Authors: Adam Jorgensen, Steven Wort

1st Edition

1118106881, 9781118106884

More Books

Students also viewed these Databases questions

Question

Brief the importance of span of control and its concepts.

Answered: 1 week ago

Question

What is meant by decentralisation?

Answered: 1 week ago

Question

Write down the Limitation of Beer - Lamberts law?

Answered: 1 week ago