Exercise 7.4

package chapter6;

public class SumFinder
{
    public static int sumWithoutSmallest(int[] values) {
        int sum = 0;
        for (int i = 0; i < values.length; i++) {
            sum = sum + values[i];
        }
        return sum - findSmallest(values);
    }
    public static int findSmallest(int[] values) {
        int smallest = values[0];
        for (int i = 0; i < values.length; i++) {
            if (values[i] < smallest) {
                smallest = values[i];
            }
        }
        return smallest;
    }