can u pls convert this algorithm into an executable code in c++ which
can find the max and min element of an array in recursive method using
divide and conquer strategy...
int a[N]; // array
int maxmin (A[])
{
Split A into two parts: A1, A2;
(max1,min1) = maxmin(A1);
(max2,min2) = maxmin(A2);
if (max1 > max2) max = max1;
else max = max2;
if (min1 < min2) min = min1;
else min = min2;
return(max,min);
}
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
