Project 4: Recursive Algorithm to Find the Minimum Integer in an Array and its Space-

Time Tradeoff Performance Comparison Analysis with an Iterative Algorithm

Due: March 8th, by 1 PM

Design and implement a recursive algorithm using Java to find the minimum integer in an array of integers. The

recursive algorithm should be in-place (i.e., its memory requirements should not grow with the input

size). You will also implement an iterative version of the algorithm to find the minimum integer in an

array of integers and compare the performance of the recursive vs. iterative versions.

Run the implementations for 100 times (automated via a loop) for each of the following values of array

size and average the results of the run-time (in milliseconds or nanoseconds, if the former is a very small

value) for the recursive and iterative versions.

Array Size: 10, 10^2, 10^3, 10^4, 10^5

The value of the elements in the array can range from 0 to 9999.