In an array of real numbers, find the minimum element among the negative elements?

Question

Java

Write a program to solve this problem in Java

Answer 1

public class minFinder {
    public static void main(String[] args) {
        float[] array = {-1,-2,-3,-4,-5,-6,-7,-8,-9,-10,10,9,8,7,6,5,4,3,2,1};
        float minVal = array[0];
        for (int i = 1; i < array.length; i++) {
            if(array[i] < minVal & array[i] < 0) minVal = array[i];
        }
        System.out.println(minVal < 0?"Min in array is " + minVal:"Min in array has not found");
    }
}

Answer 2

Assign min = 0, and then by a simple pass through the array, check the negative condition on the array elements and compare with the current smallest (if less, reassign min)

Answer 3

Use the appropriate container types. For example treeset, it is sorted. Reload Comparator if needed.