There are many ways to obtain the min and maximum value of items inside of an Array. This blog post will show case its many ways.

The most basic way to do this is to loop through the entire array manually. The benefit of doing it this way, is that it just relies on the standard library and can be easily rewritten to an even simpler form. This way uses the Math.max and Math.min method. It will also, store the min value as the Integer.MAX_VALUE as the initial value and vice versa. One other way to do it would be to keep the first index as the minimum and maximum value. So, instead of using Integer.MAX_VALUE and Integer.MIN_VALUE, the values for min and max would be numbers instead.

``````public void usingManual(int[] numbers){
if (numbers.length == 0)
throw new IllegalArgumentException("Invalid array");
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;

for(int value : numbers){
if (value > max)
max = Math.max(max, value);
if (value < min)
min = Math.min(min, value);
}

System.out.println("Min is " + min);
System.out.println("Max is " + max);
}
``````

Method 1. Using the manual method.

Another way would be to sort the array. The first index would be the least and the last index would be the maximum. This is easily done using the Array.sort method. The issue with this way is that it would sort the array in place and it also rely on the inbuilt sort method. It is generally a bad idea to use a sort in a method you want to obtain the minimum and maximum because users of this method would not expect this method to be sorting the array itself. Thus, it is better to create a clone of it or a copy of the numbers array itself so that you do not sort the elements in place but sort the cloned array instead. It is also interesting to take note that the default implementation of the sorting algorithm uses a Dual-Pivot Quicksort.

It is a good idea to do a clone on the array and save it into another variable. The reason for this is because, users of the method does not expect it for you to sort their array when the method is used. A method at the end of the day should only do a single thing.

``````public void usingSort(int[] numbers){
if (numbers.length == 0)
throw new IllegalArgumentException("Invalid array");
int[] clonedArray = numbers.clone();
Arrays.sort(clonedArray);
System.out.println("Min is " + clonedArray);
System.out.println("Max is " + clonedArray[clonedArray.length - 1]);
}
``````

Method 2. Using the in-built Arrays.sort.

You can also use a stream as well. However, it is only available in later versions of Java. The IntStream is only available since Java 1.8 and considerations need to be taken into account when using it. Here, there are is a need to decide if a parallel stream should be used as well.

``````
public void usingIntStream(int[] numbers){
if (numbers.length == 0)
throw new IllegalArgumentException("Invalid array");
IntStream intStream = Arrays.stream(numbers);
System.out.println("Min is " + intStream.min());
System.out.println("Max is " + intStream.max());
}
``````

Method 3. Using streams

Another way to do it is using the summaryStatistics of the int stream class. This is basically a state object for collecting statistics such as count, min max, sum and average. This would potentially be one of the better ways. This reason it is probably one of the better ways is because the IntSummaryStatistics is able to store other information as well besides the min and max, thus increasing its re-usability. So, there is no need for the iteration of the array itself again.

``````public void usingSummaryStats(int[] numbers){
if (numbers.length == 0)
throw new IllegalArgumentException("Invalid array");
IntSummaryStatistics stats = Arrays.stream(numbers).summaryStatistics();
System.out.println("Min is " + stats.getMin());
System.out.println("Max is " + stats.getMax());
}
``````

Method 4. Using the IntSummaryStatistics

Using the IntSummaryStatistics way is probably the preferred way if you are running Java 8 and above.

Finally, you can also use a Collections class to do it. However, in order to do so, you must box the primitive values into their class equivalent. It is important to know that this method iterates over the entire collection, hence it requires time proportional to the size of the collection.

``````public void usingCollections(int[] numbers){
if (numbers.length == 0)
throw new IllegalArgumentException("Invalid array");
List<Integer> integerList = new ArrayList<>();