HowProgrammingWorks · thebladehit · Nov 2, 2022 · Nov 2, 2022 · Nov 2, 2022 · Nov 2, 2022
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
@@ -0,0 +1,21 @@
+name: Check labs
+
+on: pull_request
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - name: Node.js
+        uses: actions/setup-node@v1
+        with:
+          node-version: 14
+      - uses: actions/cache@v2
+        with:
+          path: ~/.npm
+          key: ${{ runner.os }}-node-${{ hashFiles('**/package-lock.json') }}
+          restore-keys: |
+            ${{ runner.os }}-node-
+      - run: npm ci
+      - run: npm t
diff --git a/Exercise.ua.md b/Exercise.ua.md
@@ -0,0 +1,31 @@
+## Рекурсія
+
+1. Реалізуйте функцію `deepSum(nested)`, яка приймає масив чисел та вкладених масивів довільної глибини та повертає суму всіх чисел вкладених масивів.
+```js
+const numbers = [1, [2, 3, [4, [5]]], 6, [33]];
+const sum = deepSum(numbers);
+console.log(sum);
+```
+
+Результат:
+```
+54
+```
+
+### Використання циклів
+
+2. Реалізуйте функцію `pow(base, power)`, яка працює ідентично наступній, але з використанням циклу:
+```js
+const pow = (base, power) => {
+  if (power === 0) return 1;
+  return pow(base, power - 1) * base;
+}
+```
+
+Приклади:
+
+```js
+console.log(pow(2, 1)); // 2
+console.log(pow(2, 3)); // 8
+console.log(pow(2, 5)); // 32
+```
diff --git a/Exercises/1-showelem.js b/Exercises/1-showelem.js
@@ -0,0 +1,8 @@
+'use strict';
+
+const deepSum = (array) => {
+  // use recursion to sum all element of array
+  // deepSum([1, [2, 3, [4, [5]]], 6, [33]]) = 54
+};
+
+module.exports = { deepSum };
diff --git a/Exercises/1-showelem.test b/Exercises/1-showelem.test
@@ -0,0 +1,19 @@
+({
+  name: 'deepSum',
+  length: [150, 230],
+  cases: [
+    [[1, 2, 3], 6],
+    [[0], 0],
+    [[1, -1, 1], 1],
+    [[10, -1, -1, -1], 7],
+    [[1, [2, 3, [4, [5]]], 6, [33]], 54],
+  ],
+  test(deepSum) {
+    const src = deepSum.toString();
+    const numbers = [1, 'string', [12, 3]];
+    const sum = deepSum(numbers);
+    if (isNaN(sum)) throw new Error('Do not add string');
+    if (!src.includes('deepSum(')) throw new Error('Use recursion');
+    if (!src.includes('return')) throw new Error('Use return');
+   }
+})
diff --git a/Exercises/2-powloop.js b/Exercises/2-powloop.js
@@ -0,0 +1,8 @@
+'use strict';
+
+const pow = (base, power) => {
+  // use loop to raise a number to a power
+  // do not use recursion
+};
+
+module.exports = { pow };
diff --git a/Exercises/2-powloop.test b/Exercises/2-powloop.test
@@ -0,0 +1,15 @@
+({
+  name: 'pow',
+  length: [110, 140],
+  cases: [
+    [2, 1, 2],
+    [2, 2, 4],
+    [2, 3, 8],
+    [2, 10, 1024]
+  ],
+  test(pow) {
+    const src = pow.toString();
+    if (src.includes('pow(')) throw new Error('Do not use recursion');
+    if (!src.includes('return')) throw new Error('Use return');
+   }
+})
diff --git a/Solutions/1-showelem.js b/Solutions/1-showelem.js
@@ -0,0 +1,12 @@
+'use strict';
+
+const deepSum = (array) => {
+  let sum = 0;
+  for (const element of array) {
+    if (typeof element === 'number') sum += element;
+    if (Array.isArray(element)) sum += deepSum(element);
+  }
+  return sum;
+};
+
+module.exports = { deepSum };
diff --git a/Solutions/2-powloop.js b/Solutions/2-powloop.js
@@ -0,0 +1,11 @@
+'use strict';
+
+const pow = (base, power) => {
+  let result = 1;
+  for (let i = 0; i < power; i++) {
+    result *= base;
+  }
+  return result;
+};
+
+module.exports = { pow };