@raikuxq/alg-ds 1.1.5 → 1.2.0

package/lib/exports.d.ts

@@ -1,44 +1,53 @@
-import { factorial, memoizedFactorial } from "./algorithms/factorial";
-import { fibonacci, memoizedFibonacci } from "./algorithms/fibonacci";
-import { binarySearch } from "./algorithms/binary-search";
-import { transposeMatrix } from "./algorithms/transpose-matrix";
-import { transposeDirectedGraph } from "./data-structures/Graph/transposing/transposeDirectedGraph";
-import BFSIterationStrategy from "./data-structures/Graph/strategy/BFSIterationStrategy";
-import DFSIterationStrategy from "./data-structures/Graph/strategy/DFSIterationStrategy";
-import DijkstraIterationStrategy from "./data-structures/Graph/strategy/DijkstraIterationStrategy";
-import GraphIteratorBFS from "./data-structures/Graph/iterator/GraphIteratorBFS";
-import GraphIteratorDFS from "./data-structures/Graph/iterator/GraphIteratorDFS";
-import GraphIteratorDijkstra from "./data-structures/Graph/iterator/GraphIteratorDijkstra";
-import { hasPath } from "./data-structures/Graph/searching/hasPath";
-import { shortestPath } from "./data-structures/Graph/searching/shortestPath";
-import { presenterAdjacencyMatrix } from "./data-structures/Graph/presenter/presenterAdjacencyMatrix";
-import { presenterAdjacencyLists } from "./data-structures/Graph/presenter/presenterAdjacencyLists";
-import { generateRandomGraph } from "./data-structures/Graph/demo/generateRandomGraph";
-import { createLinkedList } from "./helpers/createLinkedList";
-import { createBinaryTree } from "./helpers/createBinaryTree";
-import { createGraph } from "./helpers/createGraph";
-import { createGraphFromMatrix } from "./helpers/createGraphFromMatrix";
-import { EDGE_EXISTS_STATE, EDGE_NOT_EXISTS_STATE } from "./constants";
-import Queue from "./data-structures/Queue/Queue";
-import Stack from "./data-structures/Stack/Stack";
-import UndirectedGraph from "./data-structures/Graph/UndirectedGraph";
-import DirectedGraph from "./data-structures/Graph/DirectedGraph";
-import BinarySearchTree from "./data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import RandBinarySearchTree from "./data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
-import DoubleLinkedList from "./data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
-import SingleLinkedList from "./data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
-import LoopedArray from "./data-structures/LoopedArray/LoopedArray";
-import HashTable from "./data-structures/HashTable/HashTable";
-import { bubbleSort } from "./algorithms/sorts/bubble-sort";
-import { selectSort } from "./algorithms/sorts/select-sort";
-import { mergeSort } from "./algorithms/sorts/merge-sort";
-import { insertionSort } from "./algorithms/sorts/insertion-sort";
-import { quickSort } from "./algorithms/sorts/quick-sort";
-import { memoize } from "./algorithms/memoize";
-import { getMinIndex, getMinIndexFromIndex, perf, randomizeNumberInRange, roundNumber, swapArrayItems, perfAsync } from "./utils";
+import { factorial, memoizedFactorial } from "./app/algorithms/factorial";
+import { fibonacci, memoizedFibonacci } from "./app/algorithms/fibonacci";
+import { binarySearch } from "./app/algorithms/binary-search";
+import { transposeMatrix } from "./app/algorithms/transpose-matrix";
+import { transposeDirectedGraph } from "./app/algorithms/graph/transposing/transposeDirectedGraph";
+import BFSIterationStrategy from "./app/algorithms/graph/iterator-strategy/BFSIterationStrategy";
+import DFSIterationStrategy from "./app/algorithms/graph/iterator-strategy/DFSIterationStrategy";
+import DijkstraIterationStrategy from "./app/algorithms/graph/iterator-strategy/DijkstraIterationStrategy";
+import GraphIteratorBFS from "./app/algorithms/graph/iterator/GraphIteratorBFS";
+import GraphIteratorDFS from "./app/algorithms/graph/iterator/GraphIteratorDFS";
+import GraphIteratorDijkstra from "./app/algorithms/graph/iterator/GraphIteratorDijkstra";
+import { hasPath } from "./app/algorithms/graph/searching/hasPath";
+import { shortestPath } from "./app/algorithms/graph/searching/shortestPath";
+import { presenterAdjacencyMatrix } from "./app/algorithms/graph/presenter/presenterAdjacencyMatrix";
+import { presenterAdjacencyLists } from "./app/algorithms/graph/presenter/presenterAdjacencyLists";
+import { generateRandomGraph } from "./app/data-structures/Graph/_helpers/generateRandomGraph";
+import { createLinkedList } from "./app/data-structures/LinkedList/_helpers/createLinkedList";
+import { createBinaryTree } from "./app/data-structures/BinaryTree/_helpers/createBinaryTree";
+import { createGraph } from "./app/data-structures/Graph/_helpers/createGraph";
+import { createGraphFromMatrix } from "./app/data-structures/Graph/_helpers/createGraphFromMatrix";
+import { EDGE_EXISTS_STATE, EDGE_NOT_EXISTS_STATE } from "./app/constants";
+import Queue from "./app/data-structures/Queue/Queue";
+import Stack from "./app/data-structures/Stack/Stack";
+import UndirectedGraph from "./app/data-structures/Graph/UndirectedGraph";
+import DirectedGraph from "./app/data-structures/Graph/DirectedGraph";
+import BinarySearchTree from "./app/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
+import RandBinarySearchTree from "./app/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
+import DoubleLinkedList from "./app/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
+import SingleLinkedList from "./app/data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
+import LoopedArray from "./app/data-structures/LoopedArray/LoopedArray";
+import HashTable from "./app/data-structures/HashTable/HashTable";
+import IsNotFoundException from "./app/exceptions/IsNotFoundException";
+import IsAlreadyExistsException from "./app/exceptions/IsAlreadyExistsException";
+import ValueOutOfRangeException from "./app/exceptions/ValueOutOfRangeException";
+import IllegalArgumentException from "./app/exceptions/base/IllegalArgumentException";
+import IllegalStateException from "./app/exceptions/base/IllegalStateException";
+import IndexOutOfBoundsException from "./app/exceptions/IndexOutOfBoundsException";
+import CollectionIsEmptyException from "./app/exceptions/CollectionIsEmptyException";
+import CollectionIsFullException from "./app/exceptions/CollectionIsFullException";
+import { bubbleSort } from "./app/algorithms/sorts/bubble-sort";
+import { selectSort } from "./app/algorithms/sorts/select-sort";
+import { mergeSort } from "./app/algorithms/sorts/merge-sort";
+import { insertionSort } from "./app/algorithms/sorts/insertion-sort";
+import { quickSort } from "./app/algorithms/sorts/quick-sort";
+import { memoize } from "./app/algorithms/memoize";
+import { getMinIndex, getMinIndexFromIndex, perf, randomizeNumberInRange, roundNumber, swapArrayItems, perfAsync } from "./app/utils";
 export { perf, getMinIndex, getMinIndexFromIndex, memoize, perfAsync, roundNumber, randomizeNumberInRange, swapArrayItems, };
 export { bubbleSort, insertionSort, mergeSort, selectSort, quickSort };
 export { Stack, Queue, SingleLinkedList, DoubleLinkedList, RandBinarySearchTree, BinarySearchTree, DirectedGraph, UndirectedGraph, LoopedArray, HashTable, };
 export { EDGE_NOT_EXISTS_STATE, EDGE_EXISTS_STATE };
 export { createGraph, createGraphFromMatrix, createBinaryTree, createLinkedList, generateRandomGraph, };
 export { binarySearch, factorial, memoizedFactorial, memoizedFibonacci, fibonacci, transposeMatrix, GraphIteratorDFS, presenterAdjacencyLists, presenterAdjacencyMatrix, hasPath, shortestPath, DijkstraIterationStrategy, DFSIterationStrategy, BFSIterationStrategy, GraphIteratorBFS, GraphIteratorDijkstra, transposeDirectedGraph, };
+export { CollectionIsEmptyException, CollectionIsFullException, IsNotFoundException, IsAlreadyExistsException, ValueOutOfRangeException, IllegalArgumentException, IllegalStateException, IndexOutOfBoundsException, };

package/lib/exports.js

@@ -1,84 +1,100 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.transposeDirectedGraph = exports.GraphIteratorDijkstra = exports.GraphIteratorBFS = exports.BFSIterationStrategy = exports.DFSIterationStrategy = exports.DijkstraIterationStrategy = exports.shortestPath = exports.hasPath = exports.presenterAdjacencyMatrix = exports.presenterAdjacencyLists = exports.GraphIteratorDFS = exports.transposeMatrix = exports.fibonacci = exports.memoizedFibonacci = exports.memoizedFactorial = exports.factorial = exports.binarySearch = exports.generateRandomGraph = exports.createLinkedList = exports.createBinaryTree = exports.createGraphFromMatrix = exports.createGraph = exports.EDGE_EXISTS_STATE = exports.EDGE_NOT_EXISTS_STATE = exports.HashTable = exports.LoopedArray = exports.UndirectedGraph = exports.DirectedGraph = exports.BinarySearchTree = exports.RandBinarySearchTree = exports.DoubleLinkedList = exports.SingleLinkedList = exports.Queue = exports.Stack = exports.quickSort = exports.selectSort = exports.mergeSort = exports.insertionSort = exports.bubbleSort = exports.swapArrayItems = exports.randomizeNumberInRange = exports.roundNumber = exports.perfAsync = exports.memoize = exports.getMinIndexFromIndex = exports.getMinIndex = exports.perf = void 0;
-var factorial_1 = require("./algorithms/factorial");
+exports.IndexOutOfBoundsException = exports.IllegalStateException = exports.IllegalArgumentException = exports.ValueOutOfRangeException = exports.IsAlreadyExistsException = exports.IsNotFoundException = exports.CollectionIsFullException = exports.CollectionIsEmptyException = exports.transposeDirectedGraph = exports.GraphIteratorDijkstra = exports.GraphIteratorBFS = exports.BFSIterationStrategy = exports.DFSIterationStrategy = exports.DijkstraIterationStrategy = exports.shortestPath = exports.hasPath = exports.presenterAdjacencyMatrix = exports.presenterAdjacencyLists = exports.GraphIteratorDFS = exports.transposeMatrix = exports.fibonacci = exports.memoizedFibonacci = exports.memoizedFactorial = exports.factorial = exports.binarySearch = exports.generateRandomGraph = exports.createLinkedList = exports.createBinaryTree = exports.createGraphFromMatrix = exports.createGraph = exports.EDGE_EXISTS_STATE = exports.EDGE_NOT_EXISTS_STATE = exports.HashTable = exports.LoopedArray = exports.UndirectedGraph = exports.DirectedGraph = exports.BinarySearchTree = exports.RandBinarySearchTree = exports.DoubleLinkedList = exports.SingleLinkedList = exports.Queue = exports.Stack = exports.quickSort = exports.selectSort = exports.mergeSort = exports.insertionSort = exports.bubbleSort = exports.swapArrayItems = exports.randomizeNumberInRange = exports.roundNumber = exports.perfAsync = exports.memoize = exports.getMinIndexFromIndex = exports.getMinIndex = exports.perf = void 0;
+var factorial_1 = require("./app/algorithms/factorial");
 Object.defineProperty(exports, "factorial", { enumerable: true, get: function () { return factorial_1.factorial; } });
 Object.defineProperty(exports, "memoizedFactorial", { enumerable: true, get: function () { return factorial_1.memoizedFactorial; } });
-var fibonacci_1 = require("./algorithms/fibonacci");
+var fibonacci_1 = require("./app/algorithms/fibonacci");
 Object.defineProperty(exports, "fibonacci", { enumerable: true, get: function () { return fibonacci_1.fibonacci; } });
 Object.defineProperty(exports, "memoizedFibonacci", { enumerable: true, get: function () { return fibonacci_1.memoizedFibonacci; } });
-var binary_search_1 = require("./algorithms/binary-search");
+var binary_search_1 = require("./app/algorithms/binary-search");
 Object.defineProperty(exports, "binarySearch", { enumerable: true, get: function () { return binary_search_1.binarySearch; } });
-var transpose_matrix_1 = require("./algorithms/transpose-matrix");
+var transpose_matrix_1 = require("./app/algorithms/transpose-matrix");
 Object.defineProperty(exports, "transposeMatrix", { enumerable: true, get: function () { return transpose_matrix_1.transposeMatrix; } });
-var transposeDirectedGraph_1 = require("./data-structures/Graph/transposing/transposeDirectedGraph");
+var transposeDirectedGraph_1 = require("./app/algorithms/graph/transposing/transposeDirectedGraph");
 Object.defineProperty(exports, "transposeDirectedGraph", { enumerable: true, get: function () { return transposeDirectedGraph_1.transposeDirectedGraph; } });
-var BFSIterationStrategy_1 = require("./data-structures/Graph/strategy/BFSIterationStrategy");
+var BFSIterationStrategy_1 = require("./app/algorithms/graph/iterator-strategy/BFSIterationStrategy");
 exports.BFSIterationStrategy = BFSIterationStrategy_1.default;
-var DFSIterationStrategy_1 = require("./data-structures/Graph/strategy/DFSIterationStrategy");
+var DFSIterationStrategy_1 = require("./app/algorithms/graph/iterator-strategy/DFSIterationStrategy");
 exports.DFSIterationStrategy = DFSIterationStrategy_1.default;
-var DijkstraIterationStrategy_1 = require("./data-structures/Graph/strategy/DijkstraIterationStrategy");
+var DijkstraIterationStrategy_1 = require("./app/algorithms/graph/iterator-strategy/DijkstraIterationStrategy");
 exports.DijkstraIterationStrategy = DijkstraIterationStrategy_1.default;
-var GraphIteratorBFS_1 = require("./data-structures/Graph/iterator/GraphIteratorBFS");
+var GraphIteratorBFS_1 = require("./app/algorithms/graph/iterator/GraphIteratorBFS");
 exports.GraphIteratorBFS = GraphIteratorBFS_1.default;
-var GraphIteratorDFS_1 = require("./data-structures/Graph/iterator/GraphIteratorDFS");
+var GraphIteratorDFS_1 = require("./app/algorithms/graph/iterator/GraphIteratorDFS");
 exports.GraphIteratorDFS = GraphIteratorDFS_1.default;
-var GraphIteratorDijkstra_1 = require("./data-structures/Graph/iterator/GraphIteratorDijkstra");
+var GraphIteratorDijkstra_1 = require("./app/algorithms/graph/iterator/GraphIteratorDijkstra");
 exports.GraphIteratorDijkstra = GraphIteratorDijkstra_1.default;
-var hasPath_1 = require("./data-structures/Graph/searching/hasPath");
+var hasPath_1 = require("./app/algorithms/graph/searching/hasPath");
 Object.defineProperty(exports, "hasPath", { enumerable: true, get: function () { return hasPath_1.hasPath; } });
-var shortestPath_1 = require("./data-structures/Graph/searching/shortestPath");
+var shortestPath_1 = require("./app/algorithms/graph/searching/shortestPath");
 Object.defineProperty(exports, "shortestPath", { enumerable: true, get: function () { return shortestPath_1.shortestPath; } });
-var presenterAdjacencyMatrix_1 = require("./data-structures/Graph/presenter/presenterAdjacencyMatrix");
+var presenterAdjacencyMatrix_1 = require("./app/algorithms/graph/presenter/presenterAdjacencyMatrix");
 Object.defineProperty(exports, "presenterAdjacencyMatrix", { enumerable: true, get: function () { return presenterAdjacencyMatrix_1.presenterAdjacencyMatrix; } });
-var presenterAdjacencyLists_1 = require("./data-structures/Graph/presenter/presenterAdjacencyLists");
+var presenterAdjacencyLists_1 = require("./app/algorithms/graph/presenter/presenterAdjacencyLists");
 Object.defineProperty(exports, "presenterAdjacencyLists", { enumerable: true, get: function () { return presenterAdjacencyLists_1.presenterAdjacencyLists; } });
-var generateRandomGraph_1 = require("./data-structures/Graph/demo/generateRandomGraph");
+var generateRandomGraph_1 = require("./app/data-structures/Graph/_helpers/generateRandomGraph");
 Object.defineProperty(exports, "generateRandomGraph", { enumerable: true, get: function () { return generateRandomGraph_1.generateRandomGraph; } });
-var createLinkedList_1 = require("./helpers/createLinkedList");
+var createLinkedList_1 = require("./app/data-structures/LinkedList/_helpers/createLinkedList");
 Object.defineProperty(exports, "createLinkedList", { enumerable: true, get: function () { return createLinkedList_1.createLinkedList; } });
-var createBinaryTree_1 = require("./helpers/createBinaryTree");
+var createBinaryTree_1 = require("./app/data-structures/BinaryTree/_helpers/createBinaryTree");
 Object.defineProperty(exports, "createBinaryTree", { enumerable: true, get: function () { return createBinaryTree_1.createBinaryTree; } });
-var createGraph_1 = require("./helpers/createGraph");
+var createGraph_1 = require("./app/data-structures/Graph/_helpers/createGraph");
 Object.defineProperty(exports, "createGraph", { enumerable: true, get: function () { return createGraph_1.createGraph; } });
-var createGraphFromMatrix_1 = require("./helpers/createGraphFromMatrix");
+var createGraphFromMatrix_1 = require("./app/data-structures/Graph/_helpers/createGraphFromMatrix");
 Object.defineProperty(exports, "createGraphFromMatrix", { enumerable: true, get: function () { return createGraphFromMatrix_1.createGraphFromMatrix; } });
-var constants_1 = require("./constants");
+var constants_1 = require("./app/constants");
 Object.defineProperty(exports, "EDGE_EXISTS_STATE", { enumerable: true, get: function () { return constants_1.EDGE_EXISTS_STATE; } });
 Object.defineProperty(exports, "EDGE_NOT_EXISTS_STATE", { enumerable: true, get: function () { return constants_1.EDGE_NOT_EXISTS_STATE; } });
-var Queue_1 = require("./data-structures/Queue/Queue");
+var Queue_1 = require("./app/data-structures/Queue/Queue");
 exports.Queue = Queue_1.default;
-var Stack_1 = require("./data-structures/Stack/Stack");
+var Stack_1 = require("./app/data-structures/Stack/Stack");
 exports.Stack = Stack_1.default;
-var UndirectedGraph_1 = require("./data-structures/Graph/UndirectedGraph");
+var UndirectedGraph_1 = require("./app/data-structures/Graph/UndirectedGraph");
 exports.UndirectedGraph = UndirectedGraph_1.default;
-var DirectedGraph_1 = require("./data-structures/Graph/DirectedGraph");
+var DirectedGraph_1 = require("./app/data-structures/Graph/DirectedGraph");
 exports.DirectedGraph = DirectedGraph_1.default;
-var BinarySearchTree_1 = require("./data-structures/BinaryTree/BinarySearchTree/BinarySearchTree");
+var BinarySearchTree_1 = require("./app/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree");
 exports.BinarySearchTree = BinarySearchTree_1.default;
-var RandBinarySearchTree_1 = require("./data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree");
+var RandBinarySearchTree_1 = require("./app/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree");
 exports.RandBinarySearchTree = RandBinarySearchTree_1.default;
-var DoubleLinkedList_1 = require("./data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList");
+var DoubleLinkedList_1 = require("./app/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList");
 exports.DoubleLinkedList = DoubleLinkedList_1.default;
-var SingleLinkedList_1 = require("./data-structures/LinkedList/SingleLinkedList/SingleLinkedList");
+var SingleLinkedList_1 = require("./app/data-structures/LinkedList/SingleLinkedList/SingleLinkedList");
 exports.SingleLinkedList = SingleLinkedList_1.default;
-var LoopedArray_1 = require("./data-structures/LoopedArray/LoopedArray");
+var LoopedArray_1 = require("./app/data-structures/LoopedArray/LoopedArray");
 exports.LoopedArray = LoopedArray_1.default;
-var HashTable_1 = require("./data-structures/HashTable/HashTable");
+var HashTable_1 = require("./app/data-structures/HashTable/HashTable");
 exports.HashTable = HashTable_1.default;
-var bubble_sort_1 = require("./algorithms/sorts/bubble-sort");
+var IsNotFoundException_1 = require("./app/exceptions/IsNotFoundException");
+exports.IsNotFoundException = IsNotFoundException_1.default;
+var IsAlreadyExistsException_1 = require("./app/exceptions/IsAlreadyExistsException");
+exports.IsAlreadyExistsException = IsAlreadyExistsException_1.default;
+var ValueOutOfRangeException_1 = require("./app/exceptions/ValueOutOfRangeException");
+exports.ValueOutOfRangeException = ValueOutOfRangeException_1.default;
+var IllegalArgumentException_1 = require("./app/exceptions/base/IllegalArgumentException");
+exports.IllegalArgumentException = IllegalArgumentException_1.default;
+var IllegalStateException_1 = require("./app/exceptions/base/IllegalStateException");
+exports.IllegalStateException = IllegalStateException_1.default;
+var IndexOutOfBoundsException_1 = require("./app/exceptions/IndexOutOfBoundsException");
+exports.IndexOutOfBoundsException = IndexOutOfBoundsException_1.default;
+var CollectionIsEmptyException_1 = require("./app/exceptions/CollectionIsEmptyException");
+exports.CollectionIsEmptyException = CollectionIsEmptyException_1.default;
+var CollectionIsFullException_1 = require("./app/exceptions/CollectionIsFullException");
+exports.CollectionIsFullException = CollectionIsFullException_1.default;
+var bubble_sort_1 = require("./app/algorithms/sorts/bubble-sort");
 Object.defineProperty(exports, "bubbleSort", { enumerable: true, get: function () { return bubble_sort_1.bubbleSort; } });
-var select_sort_1 = require("./algorithms/sorts/select-sort");
+var select_sort_1 = require("./app/algorithms/sorts/select-sort");
 Object.defineProperty(exports, "selectSort", { enumerable: true, get: function () { return select_sort_1.selectSort; } });
-var merge_sort_1 = require("./algorithms/sorts/merge-sort");
+var merge_sort_1 = require("./app/algorithms/sorts/merge-sort");
 Object.defineProperty(exports, "mergeSort", { enumerable: true, get: function () { return merge_sort_1.mergeSort; } });
-var insertion_sort_1 = require("./algorithms/sorts/insertion-sort");
+var insertion_sort_1 = require("./app/algorithms/sorts/insertion-sort");
 Object.defineProperty(exports, "insertionSort", { enumerable: true, get: function () { return insertion_sort_1.insertionSort; } });
-var quick_sort_1 = require("./algorithms/sorts/quick-sort");
+var quick_sort_1 = require("./app/algorithms/sorts/quick-sort");
 Object.defineProperty(exports, "quickSort", { enumerable: true, get: function () { return quick_sort_1.quickSort; } });
-var memoize_1 = require("./algorithms/memoize");
+var memoize_1 = require("./app/algorithms/memoize");
 Object.defineProperty(exports, "memoize", { enumerable: true, get: function () { return memoize_1.memoize; } });
-var utils_1 = require("./utils");
+var utils_1 = require("./app/utils");
 Object.defineProperty(exports, "getMinIndex", { enumerable: true, get: function () { return utils_1.getMinIndex; } });
 Object.defineProperty(exports, "getMinIndexFromIndex", { enumerable: true, get: function () { return utils_1.getMinIndexFromIndex; } });
 Object.defineProperty(exports, "perf", { enumerable: true, get: function () { return utils_1.perf; } });
@@ -86,4 +102,4 @@ Object.defineProperty(exports, "randomizeNumberInRange", { enumerable: true, get
 Object.defineProperty(exports, "roundNumber", { enumerable: true, get: function () { return utils_1.roundNumber; } });
 Object.defineProperty(exports, "swapArrayItems", { enumerable: true, get: function () { return utils_1.swapArrayItems; } });
 Object.defineProperty(exports, "perfAsync", { enumerable: true, get: function () { return utils_1.perfAsync; } });
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZXhwb3J0cy5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uL3NyYy9leHBvcnRzLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBLG9EQUFzRTtBQXFGcEUsMEZBckZPLHFCQUFTLE9BcUZQO0FBQ1Qsa0dBdEZrQiw2QkFBaUIsT0FzRmxCO0FBckZuQixvREFBc0U7QUF1RnBFLDBGQXZGTyxxQkFBUyxPQXVGUDtBQURULGtHQXRGa0IsNkJBQWlCLE9Bc0ZsQjtBQXJGbkIsNERBQTBEO0FBa0Z4RCw2RkFsRk8sNEJBQVksT0FrRlA7QUFqRmQsa0VBQWdFO0FBc0Y5RCxnR0F0Rk8sa0NBQWUsT0FzRlA7QUFyRmpCLHFHQUFvRztBQWdHbEcsdUdBaEdPLCtDQUFzQixPQWdHUDtBQS9GeEIsOEZBQXlGO0FBNEZ2RiwrQkE1RkssOEJBQW9CLENBNEZMO0FBM0Z0Qiw4RkFBeUY7QUEwRnZGLCtCQTFGSyw4QkFBb0IsQ0EwRkw7QUF6RnRCLHdHQUFtRztBQXdGakcsb0NBeEZLLG1DQUF5QixDQXdGTDtBQXZGM0Isc0ZBQWlGO0FBMEYvRSwyQkExRkssMEJBQWdCLENBMEZMO0FBekZsQixzRkFBaUY7QUFpRi9FLDJCQWpGSywwQkFBZ0IsQ0FpRkw7QUFoRmxCLGdHQUEyRjtBQXlGekYsZ0NBekZLLCtCQUFxQixDQXlGTDtBQXhGdkIscUVBQW9FO0FBa0ZsRSx3RkFsRk8saUJBQU8sT0FrRlA7QUFqRlQsK0VBQThFO0FBa0Y1RSw2RkFsRk8sMkJBQVksT0FrRlA7QUFqRmQsdUdBQXNHO0FBK0VwRyx5R0EvRU8sbURBQXdCLE9BK0VQO0FBOUUxQixxR0FBb0c7QUE2RWxHLHdHQTdFTyxpREFBdUIsT0E2RVA7QUE1RXpCLHdGQUF1RjtBQWlFckYsb0dBakVPLHlDQUFtQixPQWlFUDtBQWhFckIsK0RBQThEO0FBK0Q1RCxpR0EvRE8sbUNBQWdCLE9BK0RQO0FBOURsQiwrREFBOEQ7QUE2RDVELGlHQTdETyxtQ0FBZ0IsT0E2RFA7QUE1RGxCLHFEQUFvRDtBQTBEbEQsNEZBMURPLHlCQUFXLE9BMERQO0FBekRiLHlFQUF3RTtBQTBEdEUsc0dBMURPLDZDQUFxQixPQTBEUDtBQXpEdkIseUNBQXVFO0FBcUR2QyxrR0FyRHZCLDZCQUFpQixPQXFEdUI7QUFBeEMsc0dBckRtQixpQ0FBcUIsT0FxRG5CO0FBcEQ5Qix1REFBa0Q7QUF5Q2hELGdCQXpDSyxlQUFLLENBeUNMO0FBeENQLHVEQUFrRDtBQXVDaEQsZ0JBdkNLLGVBQUssQ0F1Q0w7QUF0Q1AsMkVBQXNFO0FBNkNwRSwwQkE3Q0sseUJBQWUsQ0E2Q0w7QUE1Q2pCLHVFQUFrRTtBQTJDaEUsd0JBM0NLLHVCQUFhLENBMkNMO0FBMUNmLG1HQUE4RjtBQXlDNUYsMkJBekNLLDBCQUFnQixDQXlDTDtBQXhDbEIsK0dBQTBHO0FBdUN4RywrQkF2Q0ssOEJBQW9CLENBdUNMO0FBdEN0QixtR0FBOEY7QUFxQzVGLDJCQXJDSywwQkFBZ0IsQ0FxQ0w7QUFwQ2xCLG1HQUE4RjtBQW1DNUYsMkJBbkNLLDBCQUFnQixDQW1DTDtBQWxDbEIseUVBQW9FO0FBd0NsRSxzQkF4Q0sscUJBQVcsQ0F3Q0w7QUF2Q2IsbUVBQThEO0FBd0M1RCxvQkF4Q0ssbUJBQVMsQ0F3Q0w7QUF2Q1gsOERBQTREO0FBMkJuRCwyRkEzQkEsd0JBQVUsT0EyQkE7QUExQm5CLDhEQUE0RDtBQTBCYiwyRkExQnRDLHdCQUFVLE9BMEJzQztBQXpCekQsNERBQTBEO0FBeUJ0QiwwRkF6QjNCLHNCQUFTLE9BeUIyQjtBQXhCN0Msb0VBQWtFO0FBd0I3Qyw4RkF4QlosOEJBQWEsT0F3Qlk7QUF2QmxDLDREQUEwRDtBQXVCQywwRkF2QmxELHNCQUFTLE9BdUJrRDtBQXRCcEUsZ0RBQStDO0FBZTdDLHdGQWZPLGlCQUFPLE9BZVA7QUFkVCxpQ0FRaUI7QUFJZiw0RkFYQSxtQkFBVyxPQVdBO0FBQ1gscUdBWEEsNEJBQW9CLE9BV0E7QUFGcEIscUZBUkEsWUFBSSxPQVFBO0FBTUosdUdBYkEsOEJBQXNCLE9BYUE7QUFEdEIsNEZBWEEsbUJBQVcsT0FXQTtBQUVYLCtGQVpBLHNCQUFjLE9BWUE7QUFIZCwwRkFSQSxpQkFBUyxPQVFBIn0=
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZXhwb3J0cy5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uL3NyYy9leHBvcnRzLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBLHdEQUEwRTtBQTZGeEUsMEZBN0ZPLHFCQUFTLE9BNkZQO0FBQ1Qsa0dBOUZrQiw2QkFBaUIsT0E4RmxCO0FBN0ZuQix3REFBMEU7QUErRnhFLDBGQS9GTyxxQkFBUyxPQStGUDtBQURULGtHQTlGa0IsNkJBQWlCLE9BOEZsQjtBQTdGbkIsZ0VBQThEO0FBMEY1RCw2RkExRk8sNEJBQVksT0EwRlA7QUF6RmQsc0VBQW9FO0FBOEZsRSxnR0E5Rk8sa0NBQWUsT0E4RlA7QUE3RmpCLG9HQUFtRztBQXdHakcsdUdBeEdPLCtDQUFzQixPQXdHUDtBQXZHeEIsc0dBQWlHO0FBb0cvRiwrQkFwR0ssOEJBQW9CLENBb0dMO0FBbkd0QixzR0FBaUc7QUFrRy9GLCtCQWxHSyw4QkFBb0IsQ0FrR0w7QUFqR3RCLGdIQUEyRztBQWdHekcsb0NBaEdLLG1DQUF5QixDQWdHTDtBQS9GM0IscUZBQWdGO0FBa0c5RSwyQkFsR0ssMEJBQWdCLENBa0dMO0FBakdsQixxRkFBZ0Y7QUF5RjlFLDJCQXpGSywwQkFBZ0IsQ0F5Rkw7QUF4RmxCLCtGQUEwRjtBQWlHeEYsZ0NBakdLLCtCQUFxQixDQWlHTDtBQWhHdkIsb0VBQW1FO0FBMEZqRSx3RkExRk8saUJBQU8sT0EwRlA7QUF6RlQsOEVBQTZFO0FBMEYzRSw2RkExRk8sMkJBQVksT0EwRlA7QUF6RmQsc0dBQXFHO0FBdUZuRyx5R0F2Rk8sbURBQXdCLE9BdUZQO0FBdEYxQixvR0FBbUc7QUFxRmpHLHdHQXJGTyxpREFBdUIsT0FxRlA7QUFwRnpCLGdHQUErRjtBQXlFN0Ysb0dBekVPLHlDQUFtQixPQXlFUDtBQXhFckIsK0ZBQThGO0FBdUU1RixpR0F2RU8sbUNBQWdCLE9BdUVQO0FBdEVsQiwrRkFBOEY7QUFxRTVGLGlHQXJFTyxtQ0FBZ0IsT0FxRVA7QUFwRWxCLGdGQUErRTtBQWtFN0UsNEZBbEVPLHlCQUFXLE9Ba0VQO0FBakViLG9HQUFtRztBQWtFakcsc0dBbEVPLDZDQUFxQixPQWtFUDtBQWpFdkIsNkNBQTJFO0FBNkQzQyxrR0E3RHZCLDZCQUFpQixPQTZEdUI7QUFBeEMsc0dBN0RtQixpQ0FBcUIsT0E2RG5CO0FBNUQ5QiwyREFBc0Q7QUFpRHBELGdCQWpESyxlQUFLLENBaURMO0FBaERQLDJEQUFzRDtBQStDcEQsZ0JBL0NLLGVBQUssQ0ErQ0w7QUE5Q1AsK0VBQTBFO0FBcUR4RSwwQkFyREsseUJBQWUsQ0FxREw7QUFwRGpCLDJFQUFzRTtBQW1EcEUsd0JBbkRLLHVCQUFhLENBbURMO0FBbERmLHVHQUFrRztBQWlEaEcsMkJBakRLLDBCQUFnQixDQWlETDtBQWhEbEIsbUhBQThHO0FBK0M1RywrQkEvQ0ssOEJBQW9CLENBK0NMO0FBOUN0Qix1R0FBa0c7QUE2Q2hHLDJCQTdDSywwQkFBZ0IsQ0E2Q0w7QUE1Q2xCLHVHQUFrRztBQTJDaEcsMkJBM0NLLDBCQUFnQixDQTJDTDtBQTFDbEIsNkVBQXdFO0FBZ0R0RSxzQkFoREsscUJBQVcsQ0FnREw7QUEvQ2IsdUVBQWtFO0FBZ0RoRSxvQkFoREssbUJBQVMsQ0FnREw7QUEvQ1gsNEVBQXVFO0FBbUZyRSw4QkFuRkssNkJBQW1CLENBbUZMO0FBbEZyQixzRkFBaUY7QUFtRi9FLG1DQW5GSyxrQ0FBd0IsQ0FtRkw7QUFsRjFCLHNGQUFpRjtBQW1GL0UsbUNBbkZLLGtDQUF3QixDQW1GTDtBQWxGMUIsMkZBQXNGO0FBbUZwRixtQ0FuRkssa0NBQXdCLENBbUZMO0FBbEYxQixxRkFBZ0Y7QUFtRjlFLGdDQW5GSywrQkFBcUIsQ0FtRkw7QUFsRnZCLHdGQUFtRjtBQW1GakYsb0NBbkZLLG1DQUF5QixDQW1GTDtBQWxGM0IsMEZBQXFGO0FBMkVuRixxQ0EzRUssb0NBQTBCLENBMkVMO0FBMUU1Qix3RkFBbUY7QUEyRWpGLG9DQTNFSyxtQ0FBeUIsQ0EyRUw7QUExRTNCLGtFQUFnRTtBQTJCdkQsMkZBM0JBLHdCQUFVLE9BMkJBO0FBMUJuQixrRUFBZ0U7QUEwQmpCLDJGQTFCdEMsd0JBQVUsT0EwQnNDO0FBekJ6RCxnRUFBOEQ7QUF5QjFCLDBGQXpCM0Isc0JBQVMsT0F5QjJCO0FBeEI3Qyx3RUFBc0U7QUF3QmpELDhGQXhCWiw4QkFBYSxPQXdCWTtBQXZCbEMsZ0VBQThEO0FBdUJILDBGQXZCbEQsc0JBQVMsT0F1QmtEO0FBdEJwRSxvREFBbUQ7QUFlakQsd0ZBZk8saUJBQU8sT0FlUDtBQWRULHFDQVFxQjtBQUluQiw0RkFYQSxtQkFBVyxPQVdBO0FBQ1gscUdBWEEsNEJBQW9CLE9BV0E7QUFGcEIscUZBUkEsWUFBSSxPQVFBO0FBTUosdUdBYkEsOEJBQXNCLE9BYUE7QUFEdEIsNEZBWEEsbUJBQVcsT0FXQTtBQUVYLCtGQVpBLHNCQUFjLE9BWUE7QUFIZCwwRkFSQSxpQkFBUyxPQVFBIn0=

package/lib/index.js

@@ -2,5 +2,4 @@
 /**
  * Write your code here
  */
-console.log("Hello world");
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IjtBQUFBOztHQUVHO0FBRUgsT0FBTyxDQUFDLEdBQUcsQ0FBQyxhQUFhLENBQUMsQ0FBQyJ9
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IjtBQUFBOztHQUVHIn0=

package/package.json

@@ -3,17 +3,19 @@
   "scripts": {
     "test": "jest",
     "dev": "nodemon",
-    "build": "rimraf ./build && tsc",
+    "build": "rimraf ./lib && tsc",
     "start": "npm run build && node lib/index.js",
     "lint": "yarn eslint . --ext .ts",
-    "lint:fix": "yarn eslint --fix .  --ext .ts"
+    "lint:fix": "yarn eslint --fix .  --ext .ts",
+    "docs:dev": "vuepress dev docs",
+    "docs:build": "vuepress build docs"
   },
   "repository": {
     "type": "git",
     "url": "https://github.com/raikuxq/lab-ts-algorithms"
   },
-  "main": "./lib/exports.js",
-  "types": "./lib/exports.d.ts",
+  "main": "./lib/src/exports.js",
+  "types": "./lib/src/exports.d.ts",
   "files": [
     "lib",
     "README.md",
@@ -24,6 +26,8 @@
     "@types/node": "^14.0.24",
     "@typescript-eslint/eslint-plugin": "^4.4.0",
     "@typescript-eslint/parser": "^4.4.0",
+    "@vuepress/plugin-search": "^2.0.0-beta.48",
+    "@vuepress/theme-default": "^2.0.0-beta.48",
     "eslint": "^7.11.0",
     "eslint-config-prettier": "^6.12.0",
     "eslint-config-recommended": "^4.1.0",
@@ -35,8 +39,9 @@
     "ts-jest": "^26.4.1",
     "ts-node": "^10.7.0",
     "ts-node-esm": "^0.0.6",
-    "typescript": "^4.0.3"
+    "typescript": "^4.0.3",
+    "vuepress": "^2.0.0-beta.48"
   },
   "dependencies": {},
-  "version": "1.1.5"
+  "version": "1.2.0"
 }

package/lib/algorithms/binary-search.js

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.binarySearch = void 0;
-/**
- * Find element's index in sorted array
- * Time complexity: O(log(n))
- */
-exports.binarySearch = function (elements, searchElement) {
-    var length = elements.length;
-    var leftIndex = 0;
-    var rightIndex = length - 1;
-    while (leftIndex <= rightIndex) {
-        var midIndex = Math.ceil((leftIndex + rightIndex) / 2);
-        var midEl = elements[midIndex];
-        if (searchElement == midEl) {
-            return midIndex;
-        }
-        else if (midEl > searchElement) {
-            rightIndex = midIndex - 1;
-        }
-        else if (midEl < searchElement) {
-            leftIndex = midIndex + 1;
-        }
-    }
-    return null;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYmluYXJ5LXNlYXJjaC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hbGdvcml0aG1zL2JpbmFyeS1zZWFyY2gudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUE7OztHQUdHO0FBQ1UsUUFBQSxZQUFZLEdBQUcsVUFDMUIsUUFBdUIsRUFDdkIsYUFBcUI7SUFFckIsSUFBTSxNQUFNLEdBQVcsUUFBUSxDQUFDLE1BQU0sQ0FBQztJQUV2QyxJQUFJLFNBQVMsR0FBRyxDQUFDLENBQUM7SUFDbEIsSUFBSSxVQUFVLEdBQVcsTUFBTSxHQUFHLENBQUMsQ0FBQztJQUVwQyxPQUFPLFNBQVMsSUFBSSxVQUFVLEVBQUU7UUFDOUIsSUFBTSxRQUFRLEdBQVcsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDLFNBQVMsR0FBRyxVQUFVLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQztRQUNqRSxJQUFNLEtBQUssR0FBVyxRQUFRLENBQUMsUUFBUSxDQUFDLENBQUM7UUFFekMsSUFBSSxhQUFhLElBQUksS0FBSyxFQUFFO1lBQzFCLE9BQU8sUUFBUSxDQUFDO1NBQ2pCO2FBQU0sSUFBSSxLQUFLLEdBQUcsYUFBYSxFQUFFO1lBQ2hDLFVBQVUsR0FBRyxRQUFRLEdBQUcsQ0FBQyxDQUFDO1NBQzNCO2FBQU0sSUFBSSxLQUFLLEdBQUcsYUFBYSxFQUFFO1lBQ2hDLFNBQVMsR0FBRyxRQUFRLEdBQUcsQ0FBQyxDQUFDO1NBQzFCO0tBQ0Y7SUFFRCxPQUFPLElBQUksQ0FBQztBQUNkLENBQUMsQ0FBQyJ9

package/lib/algorithms/fibonacci.js

@@ -1,17 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.memoizedFibonacci = exports.fibonacci = void 0;
-var memoize_1 = require("./memoize");
-/**
- * Time complexity: O(n!)
- */
-exports.fibonacci = function (n) {
-    return n > 1 ? exports.fibonacci(n - 1) + exports.fibonacci(n - 2) : n;
-};
-/**
- * Time complexity: O(n) - due to caching
- */
-exports.memoizedFibonacci = memoize_1.memoize(function (n) {
-    return n > 1 ? exports.memoizedFibonacci(n - 1) + exports.memoizedFibonacci(n - 2) : n;
-});
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZmlib25hY2NpLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2FsZ29yaXRobXMvZmlib25hY2NpLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUNBLHFDQUFvQztBQUVwQzs7R0FFRztBQUNVLFFBQUEsU0FBUyxHQUFHLFVBQUMsQ0FBUztJQUNqQyxPQUFPLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDLGlCQUFTLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxHQUFHLGlCQUFTLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxDQUFDLENBQUMsQ0FBQyxDQUFDLENBQUM7QUFDekQsQ0FBQyxDQUFDO0FBRUY7O0dBRUc7QUFDVSxRQUFBLGlCQUFpQixHQUFnQyxpQkFBTyxDQUNuRSxVQUFDLENBQVM7SUFDUixPQUFPLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDLHlCQUFpQixDQUFDLENBQUMsR0FBRyxDQUFDLENBQUMsR0FBRyx5QkFBaUIsQ0FBQyxDQUFDLEdBQUcsQ0FBQyxDQUFDLENBQUMsQ0FBQyxDQUFDLENBQUMsQ0FBQztBQUN6RSxDQUFDLENBQ0YsQ0FBQyJ9

package/lib/algorithms/sorts/insertion-sort.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.insertionSort = void 0;
-var utils_1 = require("../../utils");
-/**
- * Insertion sorting algorithm
- *
- * @description
- * Time complexity: Best O(n); Avg O(n \^ 2); Worst O(n \^ 2);
- * @description
- * Memory complexity: Worst case: O(1)
- */
-exports.insertionSort = function (arr) {
-    for (var i = 1; i < arr.length; i++) {
-        var current = arr[i];
-        var j = i - 1;
-        while (j >= 0 && arr[j] > current) {
-            utils_1.swapArrayItems(arr, j + 1, j);
-            j--;
-        }
-        arr[j + 1] = current;
-    }
-    return arr;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5zZXJ0aW9uLXNvcnQuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvYWxnb3JpdGhtcy9zb3J0cy9pbnNlcnRpb24tc29ydC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFBQSxxQ0FBNkM7QUFFN0M7Ozs7Ozs7R0FPRztBQUNVLFFBQUEsYUFBYSxHQUFHLFVBQUMsR0FBa0I7SUFDOUMsS0FBSyxJQUFJLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBQyxHQUFHLEdBQUcsQ0FBQyxNQUFNLEVBQUUsQ0FBQyxFQUFFLEVBQUU7UUFDbkMsSUFBTSxPQUFPLEdBQUcsR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDO1FBQ3ZCLElBQUksQ0FBQyxHQUFHLENBQUMsR0FBRyxDQUFDLENBQUM7UUFFZCxPQUFPLENBQUMsSUFBSSxDQUFDLElBQUksR0FBRyxDQUFDLENBQUMsQ0FBQyxHQUFHLE9BQU8sRUFBRTtZQUNqQyxzQkFBYyxDQUFDLEdBQUcsRUFBRSxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUMsQ0FBQyxDQUFDO1lBQzlCLENBQUMsRUFBRSxDQUFDO1NBQ0w7UUFFRCxHQUFHLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxHQUFHLE9BQU8sQ0FBQztLQUN0QjtJQUVELE9BQU8sR0FBRyxDQUFDO0FBQ2IsQ0FBQyxDQUFDIn0=

package/lib/algorithms/sorts/merge-sort.js

@@ -1,61 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mergeSort = void 0;
-/**
- * Merge two sorted arrays into one array
- */
-var merge = function (arr, leftIndex, midIndex, rightIndex) {
-    var container = arr.slice(leftIndex, rightIndex + 1);
-    var resultArrIndex = leftIndex;
-    var leftHalfIndex = leftIndex;
-    var rightHalfIndex = midIndex + 1;
-    /** While both halves of array are not ended */
-    while (leftHalfIndex <= midIndex && rightHalfIndex <= rightIndex) {
-        var leftHalfElement = container[leftHalfIndex - leftIndex];
-        var rightHalfElement = container[rightHalfIndex - leftIndex];
-        if (leftHalfElement < rightHalfElement) {
-            arr[resultArrIndex] = leftHalfElement;
-            leftHalfIndex++;
-        }
-        else {
-            arr[resultArrIndex] = rightHalfElement;
-            rightHalfIndex++;
-        }
-        resultArrIndex++;
-    }
-    /** If one of halves is ended, the remaining one will just be pushed to result */
-    while (leftHalfIndex <= midIndex) {
-        arr[resultArrIndex] = container[leftHalfIndex - leftIndex];
-        resultArrIndex++;
-        leftHalfIndex++;
-    }
-    while (rightHalfIndex <= rightIndex) {
-        arr[resultArrIndex] = container[rightHalfIndex - leftIndex];
-        resultArrIndex++;
-        rightHalfIndex++;
-    }
-};
-/**
- * Divide array into 2 halves and merge them
- */
-var sortRange = function (arr, leftIndex, rightIndex) {
-    if (rightIndex > leftIndex) {
-        var midIndex = Math.floor(leftIndex + (rightIndex - leftIndex) / 2);
-        sortRange(arr, leftIndex, midIndex);
-        sortRange(arr, midIndex + 1, rightIndex);
-        merge(arr, leftIndex, midIndex, rightIndex);
-    }
-};
-/**
- * Merge sorting algorithm
- *
- * @description
- * Time complexity: Best O(n * log(n)); Avg O(n * log(n)); Worst O(n * log(n))
- * @description
- * Memory complexity: Worst case: O(n)
- */
-exports.mergeSort = function (arr) {
-    sortRange(arr, 0, arr.length - 1);
-    return arr;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibWVyZ2Utc29ydC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9hbGdvcml0aG1zL3NvcnRzL21lcmdlLXNvcnQudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUE7O0dBRUc7QUFDSCxJQUFNLEtBQUssR0FBRyxVQUNaLEdBQWtCLEVBQ2xCLFNBQWlCLEVBQ2pCLFFBQWdCLEVBQ2hCLFVBQWtCO0lBRWxCLElBQU0sU0FBUyxHQUFHLEdBQUcsQ0FBQyxLQUFLLENBQUMsU0FBUyxFQUFFLFVBQVUsR0FBRyxDQUFDLENBQUMsQ0FBQztJQUV2RCxJQUFJLGNBQWMsR0FBRyxTQUFTLENBQUM7SUFDL0IsSUFBSSxhQUFhLEdBQUcsU0FBUyxDQUFDO0lBQzlCLElBQUksY0FBYyxHQUFHLFFBQVEsR0FBRyxDQUFDLENBQUM7SUFFbEMsK0NBQStDO0lBQy9DLE9BQU8sYUFBYSxJQUFJLFFBQVEsSUFBSSxjQUFjLElBQUksVUFBVSxFQUFFO1FBQ2hFLElBQU0sZUFBZSxHQUFHLFNBQVMsQ0FBQyxhQUFhLEdBQUcsU0FBUyxDQUFDLENBQUM7UUFDN0QsSUFBTSxnQkFBZ0IsR0FBRyxTQUFTLENBQUMsY0FBYyxHQUFHLFNBQVMsQ0FBQyxDQUFDO1FBRS9ELElBQUksZUFBZSxHQUFHLGdCQUFnQixFQUFFO1lBQ3RDLEdBQUcsQ0FBQyxjQUFjLENBQUMsR0FBRyxlQUFlLENBQUM7WUFDdEMsYUFBYSxFQUFFLENBQUM7U0FDakI7YUFBTTtZQUNMLEdBQUcsQ0FBQyxjQUFjLENBQUMsR0FBRyxnQkFBZ0IsQ0FBQztZQUN2QyxjQUFjLEVBQUUsQ0FBQztTQUNsQjtRQUNELGNBQWMsRUFBRSxDQUFDO0tBQ2xCO0lBRUQsaUZBQWlGO0lBQ2pGLE9BQU8sYUFBYSxJQUFJLFFBQVEsRUFBRTtRQUNoQyxHQUFHLENBQUMsY0FBYyxDQUFDLEdBQUcsU0FBUyxDQUFDLGFBQWEsR0FBRyxTQUFTLENBQUMsQ0FBQztRQUMzRCxjQUFjLEVBQUUsQ0FBQztRQUNqQixhQUFhLEVBQUUsQ0FBQztLQUNqQjtJQUNELE9BQU8sY0FBYyxJQUFJLFVBQVUsRUFBRTtRQUNuQyxHQUFHLENBQUMsY0FBYyxDQUFDLEdBQUcsU0FBUyxDQUFDLGNBQWMsR0FBRyxTQUFTLENBQUMsQ0FBQztRQUM1RCxjQUFjLEVBQUUsQ0FBQztRQUNqQixjQUFjLEVBQUUsQ0FBQztLQUNsQjtBQUNILENBQUMsQ0FBQztBQUVGOztHQUVHO0FBQ0gsSUFBTSxTQUFTLEdBQUcsVUFDaEIsR0FBa0IsRUFDbEIsU0FBaUIsRUFDakIsVUFBa0I7SUFFbEIsSUFBSSxVQUFVLEdBQUcsU0FBUyxFQUFFO1FBQzFCLElBQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUMsU0FBUyxHQUFHLENBQUMsVUFBVSxHQUFHLFNBQVMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxDQUFDO1FBRXRFLFNBQVMsQ0FBQyxHQUFHLEVBQUUsU0FBUyxFQUFFLFFBQVEsQ0FBQyxDQUFDO1FBQ3BDLFNBQVMsQ0FBQyxHQUFHLEVBQUUsUUFBUSxHQUFHLENBQUMsRUFBRSxVQUFVLENBQUMsQ0FBQztRQUV6QyxLQUFLLENBQUMsR0FBRyxFQUFFLFNBQVMsRUFBRSxRQUFRLEVBQUUsVUFBVSxDQUFDLENBQUM7S0FDN0M7QUFDSCxDQUFDLENBQUM7QUFFRjs7Ozs7OztHQU9HO0FBQ1UsUUFBQSxTQUFTLEdBQUcsVUFBQyxHQUFrQjtJQUMxQyxTQUFTLENBQUMsR0FBRyxFQUFFLENBQUMsRUFBRSxHQUFHLENBQUMsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDO0lBRWxDLE9BQU8sR0FBRyxDQUFDO0FBQ2IsQ0FBQyxDQUFDIn0=

package/lib/algorithms/transpose-matrix.d.ts

@@ -1,5 +0,0 @@
-import { ArrayMatrix } from "../types/ArrayMatrix";
-/**
- * Will flips a matrix over its diagonal
- */
-export declare const transposeMatrix: (matrix: ArrayMatrix) => ArrayMatrix;

package/lib/algorithms/transpose-matrix.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.transposeMatrix = void 0;
-/**
- * Will flips a matrix over its diagonal
- */
-exports.transposeMatrix = function (matrix) {
-    /** Validation */
-    matrix.forEach(function (subArray) {
-        var checkIsSameLength = subArray.length === matrix.length;
-        if (!checkIsSameLength) {
-            throw new Error("Given array is not a matrix");
-        }
-    });
-    return matrix.reduce(function (acc, current, currentIndex) {
-        acc[currentIndex] = matrix.map(function (rowArr) { return rowArr[currentIndex]; });
-        return acc;
-    }, new Array(matrix.length));
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHJhbnNwb3NlLW1hdHJpeC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hbGdvcml0aG1zL3RyYW5zcG9zZS1tYXRyaXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBRUE7O0dBRUc7QUFDVSxRQUFBLGVBQWUsR0FBRyxVQUFDLE1BQW1CO0lBQ2pELGlCQUFpQjtJQUNqQixNQUFNLENBQUMsT0FBTyxDQUFDLFVBQUMsUUFBUTtRQUN0QixJQUFNLGlCQUFpQixHQUFHLFFBQVEsQ0FBQyxNQUFNLEtBQUssTUFBTSxDQUFDLE1BQU0sQ0FBQztRQUM1RCxJQUFJLENBQUMsaUJBQWlCLEVBQUU7WUFDdEIsTUFBTSxJQUFJLEtBQUssQ0FBQyw2QkFBNkIsQ0FBQyxDQUFDO1NBQ2hEO0lBQ0gsQ0FBQyxDQUFDLENBQUM7SUFFSCxPQUFPLE1BQU0sQ0FBQyxNQUFNLENBQUMsVUFBQyxHQUFHLEVBQUUsT0FBTyxFQUFFLFlBQVk7UUFDOUMsR0FBRyxDQUFDLFlBQVksQ0FBQyxHQUFHLE1BQU0sQ0FBQyxHQUFHLENBQUMsVUFBQyxNQUFNLElBQUssT0FBQSxNQUFNLENBQUMsWUFBWSxDQUFDLEVBQXBCLENBQW9CLENBQUMsQ0FBQztRQUNqRSxPQUFPLEdBQUcsQ0FBQztJQUNiLENBQUMsRUFBRSxJQUFJLEtBQUssQ0FBQyxNQUFNLENBQUMsTUFBTSxDQUFDLENBQUMsQ0FBQztBQUMvQixDQUFDLENBQUMifQ==