kavididesilva / challenge3

Challenge 3. This Java program contains five functions: SortArray, FindMode, FindMedian, HighestValue, and FindPrimeNumber. These functions can be helpful in various numerical analysis applications.

ArrayProcessor.java

Challenge3

This GitHub repository contains a Java program that implements five different algorithms:

1. SortArray - sorts an array of integers in ascending order
2. FindMode - finds the mode (most frequent value) in an array of integers
3. FindMedian - finds the median (middle value) in an array of integers
4. HighestValue - finds the highest value in an array of integers
5. FindPrimeNumber - checks if a given integer is a prime number or not.

These functions can be useful in various applications where numerical analysis is required.