fix(maths): prevent infinite recursion on negative inputs in BinomialCoefficient

Author: Bhumit267

src/main/java/com/thealgorithms/maths/BinomialCoefficient.java

@@ -21,9 +21,14 @@ private BinomialCoefficient() {
      * @param numberOfObjects Number of objects to be chosen from total_objects
      * @return number of ways in which no_of_objects objects can be chosen from total_objects
      *     objects
+     * @throws IllegalArgumentException if totalObjects or numberOfObjects is negative
      */
 
     public static int binomialCoefficient(int totalObjects, int numberOfObjects) {
+        if (totalObjects < 0 || numberOfObjects < 0) {
+            throw new IllegalArgumentException("Arguments must be non-negative.");
+        }
+
         // Base Case
         if (numberOfObjects > totalObjects) {
             return 0;

src/test/java/com/thealgorithms/maths/BinomialCoefficientTest.java

@@ -1,6 +1,7 @@
 package com.thealgorithms.maths;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 import org.junit.jupiter.api.Test;
 
@@ -12,5 +13,14 @@ void testBinomialCoefficient() {
         assertEquals(792, BinomialCoefficient.binomialCoefficient(12, 5));
         assertEquals(84, BinomialCoefficient.binomialCoefficient(9, 3));
         assertEquals(1, BinomialCoefficient.binomialCoefficient(17, 17));
+        assertEquals(0, BinomialCoefficient.binomialCoefficient(5, 6));
+        assertEquals(1, BinomialCoefficient.binomialCoefficient(0, 0));
+    }
+
+    @Test
+    void testNegativeInputs() {
+        assertThrows(IllegalArgumentException.class, () -> BinomialCoefficient.binomialCoefficient(5, -1));
+        assertThrows(IllegalArgumentException.class, () -> BinomialCoefficient.binomialCoefficient(-1, 5));
+        assertThrows(IllegalArgumentException.class, () -> BinomialCoefficient.binomialCoefficient(-5, -2));
     }
 }