refactor: Change gcd implementation to attempt faster calc

src/utils/poly.rs

@@ -576,9 +576,21 @@ pub fn gcd(a: &Polynomial, b: &Polynomial) -> Polynomial {
     if a.is_zero() {
         return b.clone();
     }
+    if b.is_zero() {
+        return a.clone();
+    }
 
-    let monic_b = b.div(&a).1.monic();
+    if a.degree() > b.degree() {
-    return gcd(&monic_b, a);
+        return gcd(b, a);
+    }
+
+    let (_, remainder) = b.div(a);
+
+    if remainder.is_zero() {
+        return a.clone().monic();
+    }
+
+    gcd(&remainder, a)
 }
 
 pub fn non_monic_gcd(a: &Polynomial, b: &Polynomial) -> Polynomial {

test_json/sandbox.json

@@ -1,18 +1,18 @@
 {
   "testcases": {
     "sandbox": {
-      "action": "gfpoly_factor_ddf",
+      "action": "gfpoly_factor_edf",
       "arguments": {
         "F": [
-          "tpkgAAAAAAAAAAAAAAAAAA==",
+          "mmAAAAAAAAAAAAAAAAAAAA==",
-          "m6MQAAAAAAAAAAAAAAAAAA==",
+          "AbAAAAAAAAAAAAAAAAAAAA==",
-          "8roAAAAAAAAAAAAAAAAAAA==",
+          "zgAAAAAAAAAAAAAAAAAAAA==",
-          "3dUAAAAAAAAAAAAAAAAAAA==",
           "FwAAAAAAAAAAAAAAAAAAAA==",
-          "/kAAAAAAAAAAAAAAAAAAAA==",
+          "AAAAAAAAAAAAAAAAAAAAAA==",
-          "a4AAAAAAAAAAAAAAAAAAAA==",
+          "wAAAAAAAAAAAAAAAAAAAAA==",
           "gAAAAAAAAAAAAAAAAAAAAA=="
-        ]
+        ],
+        "d": 3
       }
     }
   }