@gabrielrufino/cerebrum 1.2.0 → 1.3.0

package/dist/Sort/MergeSort.js

@@ -0,0 +1,36 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MergeSort = void 0;
+const Sort_1 = require("./Sort");
+class MergeSort extends Sort_1.Sort {
+    execute() {
+        if (this.numbers.length <= 1) {
+            return [...this.numbers];
+        }
+        const middle = Math.floor(this.numbers.length / 2);
+        const left = this.numbers.slice(0, middle);
+        const right = this.numbers.slice(middle);
+        return this.merge(new MergeSort(left).execute(), new MergeSort(right).execute());
+    }
+    merge(left, right) {
+        const result = [];
+        let leftIndex = 0;
+        let rightIndex = 0;
+        while (leftIndex < left.length && rightIndex < right.length) {
+            if (left[leftIndex] < right[rightIndex]) {
+                result.push(left[leftIndex]);
+                leftIndex += 1;
+            }
+            else {
+                result.push(right[rightIndex]);
+                rightIndex += 1;
+            }
+        }
+        return [
+            ...result,
+            ...left.slice(leftIndex),
+            ...right.slice(rightIndex)
+        ];
+    }
+}
+exports.MergeSort = MergeSort;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gabrielrufino/cerebrum",
-  "version": "1.2.0",
+  "version": "1.3.0",
   "description": "Algorithms made in TypeScript",
   "main": "dist/index.js",
   "type": "module",

package/src/Sort/MergeSort.spec.ts

@@ -0,0 +1,8 @@
+import { describe } from 'vitest'
+
+import { SortTestsSuite } from './Sort.spec'
+import { MergeSort } from './MergeSort'
+
+describe('MergeSort', () => {
+  SortTestsSuite.execute(MergeSort)
+})

package/src/Sort/MergeSort.ts

@@ -0,0 +1,38 @@
+import { Sort } from './Sort';
+
+export class MergeSort extends Sort {
+  public execute(): Array<number> {
+    if (this.numbers.length <= 1) {
+      return [...this.numbers]
+    }
+
+    const middle = Math.floor(this.numbers.length / 2)
+    const left = this.numbers.slice(0, middle)
+    const right = this.numbers.slice(middle)
+
+    return this.merge(new MergeSort(left).execute(), new MergeSort(right).execute())
+  }
+
+  private merge(left: number[], right: number[]): number[] {
+    const result: number[] = []
+
+    let leftIndex = 0
+    let rightIndex = 0
+
+    while (leftIndex < left.length && rightIndex < right.length) {
+      if (left[leftIndex] < right[rightIndex]) {
+        result.push(left[leftIndex])
+        leftIndex += 1
+      } else {
+        result.push(right[rightIndex])
+        rightIndex += 1
+      }
+    }
+
+    return [
+      ...result,
+      ...left.slice(leftIndex),
+      ...right.slice(rightIndex)
+    ]
+  }
+}