Cartesian algorithm

Author: edignot

src/sets/sets.js

@@ -0,0 +1,12 @@
+// Set - a collection of values which forms an entity itself, most arrays are sets ( connected values )
+
+// Set Algorithm Example: Cartesian Product Algorithm:
+export const getCartesianProducts = (colors, sizes) => {
+    const options = [];
+    for (let c = 0; c < colors.length; c++) {
+        for (let s = 0; s < sizes.length; s++) {
+            options.push([colors[c], sizes[s]]);
+        }
+    }
+    return options;
+};

src/sets/sets.test.js

@@ -0,0 +1,31 @@
+import { getCartesianProducts } from "./sets";
+
+describe("Cartesian Product", () => {
+    test("Cartesian Product", () => {
+        expect(
+            getCartesianProducts(["blue", "red"], ["S", "M", "L"])
+        ).toStrictEqual([
+            ["blue", "S"],
+            ["blue", "M"],
+            ["blue", "L"],
+            ["red", "S"],
+            ["red", "M"],
+            ["red", "L"],
+        ]);
+    });
+    test("Cartesian Product", () => {
+        expect(
+            getCartesianProducts(["blue", "red", "white"], ["S", "M", "L"])
+        ).toStrictEqual([
+            ["blue", "S"],
+            ["blue", "M"],
+            ["blue", "L"],
+            ["red", "S"],
+            ["red", "M"],
+            ["red", "L"],
+            ["white", "S"],
+            ["white", "M"],
+            ["white", "L"],
+        ]);
+    });
+});