We have seen an iterative algorithm to find minimum or maximum
of a given array. In this
problem, we will use divide and conquer to do the same. That is,
given an integer array,
find the minimum and maximum element present in it by making
minimum comparisons.
Describe your divide strategy, conquer strategy, and merge strategy
in detail. Full points
would be awarded for arguing correctness of the algorithm and the
run-time.