Smallest Number that is not a Sum of a Subset of List

Author: eknv

src/main/java/com/eknv/algorithms/arrays/SmallestNumberNotSumOfSubset.java

@@ -23,7 +23,7 @@ public static int calculate(int[] numbers) {
         Assert.notNull(numbers, "numbers");
 
         if (numbers.length == 0) {
-            throw new RuntimeException("The list cannot be empty");
+            throw new IllegalArgumentException("The list cannot be empty");
         }
 
         validateIsSorted(numbers);
@@ -88,7 +88,7 @@ private static void validateIsSorted(int[] numbers) {
         for (int i = 0; i < numbers.length; i++) {
 
             if (numbers[i] < prevValue) {
-                throw new RuntimeException("This array is not sorted");
+                throw new IllegalArgumentException("This array is not sorted");
             } else {
                 prevValue = numbers[i];
             }