Find the problem statement, analysis, algorithm design, class prototype, program
ID: 3694876 • Letter: F
Question
Find the problem statement, analysis, algorithm design, class prototype, program Input/Output, and tested results for the algorithm below.
int max(int a[],int start,int end1)
{
if(end1==start) return a[start];
int mid = (end1-start)/2;
int max1 = max(a,start,start+mid);
int max2 = max(a,start+mid+1,end1);
if(max1>max2) return max1;
return max2;
}
int min(int a[],int start,int end1)
{
if(end1==start) return a[start];
int mid = (end1-start)/2;
int min1 = min(a,start,start+mid);
int min2 = min(a,start+mid+1,end1);
if(min1<min2) return min1;
return min2;
}
Explanation / Answer
//
// File: newmain.cc
// Author: RAM
//
// Created on 27 April, 2016, 9:21 PM
//
#include <stdlib.h>
//
//
//
int max(int a[],int start,int end1)
{
if(end1==start)
return a[start];
int mid = (end1-start)/2;
int max1 = max(a,start,start+mid);
int max2 = max(a,start+mid+1,end1);
if(max1>max2)
return max1;
return max2;
}
int min(int a[],int start,int end1)
{
if(end1==start)
return a[start];
int mid = (end1-start)/2;
int min1 = min(a,start,start+mid);
int min2 = min(a,start+mid+1,end1);
if(min1<min2)
return min1;
return min2;
}
int main(int argc, char** argv) {
int a[]={1,3,5,6,8,11};
cout<<"from main:"<<endl;
cout<<"Enter start value";<<endl;
cin>>start;
cout<<"Enter end1 value"<<endl;
cin>>end1;
int min1;
int max2;
min1 = min(a[],start,end1);
max2 = max(a[],start,end1);
cout<<"min value"<<min1;
cout<<"max value"<<max2;
return 0;
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.