Plus one commit

.dccache

@@ -0,0 +1 @@
+{"c:/algorithm.js/jest.config.js":[590,1651734789211.906,"85faffa701831f86db01cdc1d579f9c01065fff014030a9c797a09643782057f"],"c:/algorithm.js/dist/index-min-min.js":[627,1652514270149.799,"b561ffdb4d06aec0f7f4be0f9effcb0d4c8d79f08f5d6c887fa2cf759dac5915"],"c:/algorithm.js/dist/index-min.js":[627,1652514270182.7998,"b561ffdb4d06aec0f7f4be0f9effcb0d4c8d79f08f5d6c887fa2cf759dac5915"],"c:/algorithm.js/dist/index.js":[739,1652604914568.724,"ef76fb2fb05b1722064df11798f0e08b097ddb89e7e2e0227851fc3bc637faa9"],"c:/algorithm.js/lib/index.ts":[161,1651738717063.7817,"ac8edb0bb0913be5c43393b5046165564d6d531b6499f57dbb4ba16f4f10fa00"],"c:/algorithm.js/dist/utils/algorithm-min.js":[163,1652514211846.5176,"6f6d5e5330627810caa290d66b138021ee199d1b9e3b77f30a3a2c40a88d0891"],"c:/algorithm.js/dist/utils/algorithm.js":[240,1652604914555.7244,"5b2ae4bb91ddc7f1a060ff05d6a06705bd3b975ff79811e43bd6f07129af79e0"],"c:/algorithm.js/dist/utils/big-o-notation.js":[1679,1652604914566.724,"7f82d876c7782d420d31cfdefca4c4169aca82cdb5be0e900ca9f74739b0b2fb"],"c:/algorithm.js/dist/utils/data-structure.js":[556,1652604914564.7212,"2bb844c6307b14d705e5c2b09663e9e257cf27412f7c63152046be095dfcb265"],"c:/algorithm.js/lib/utils/algorithm.ts":[77,1652340172001.0771,"746a6f091f3ad8fdaa6369af5f8ad963c3053d488cf1cff098f3a313722f2012"],"c:/algorithm.js/lib/utils/big-o-notation.ts":[1393,1652546181562.8457,"005b6af6b6a8d3997801f98bb221a1e6d29b94357a502ff8afe6a51b625f4a9b"],"c:/algorithm.js/lib/utils/data-structure.ts":[535,1652602559645.1543,"ed57e78351ddfc5c40001f9488d2a76b0707408f92bb0bddcf5a170fdf1bbeb9"],"c:/algorithm.js/dist/utils/algorithms/binary-search.js":[875,1652604914569.7217,"c5d0c361a617c65eb4daf2c166b7887663e37f0ab30e8a0795e6fb624d5a196d"],"c:/algorithm.js/dist/utils/algorithms/bubble-sort.js":[709,1652604914572.7236,"76ee8a90bd07d273aac202b5f669a09b7e9a7f0d01ebc9582af55199a35046f3"],"c:/algorithm.js/dist/utils/algorithms/bucket-sort.js":[631,1652604914573.7227,"1c247c049976557b93cb6e26a5ddc77af5770694b29e70996e0848f63bd2e540"],"c:/algorithm.js/dist/utils/algorithms/counting-sort.js":[886,1652604914574.7244,"6519a9b6c1b7ec6fca85aeac6cb40a60d6313f3e699fa0fd9a8c913b3f514492"],"c:/algorithm.js/dist/utils/algorithms/cycle-sort.js":[1523,1652604914575.7202,"b6e390f7f354ab8050545a57f1c2e10f0e50b1839d99780aab3029fa5081a409"],"c:/algorithm.js/dist/utils/algorithms/dijstras-algorithm.js":[326,1652604914576.724,"825c13509211249844f9644879c11a9ef53fb8f9f7341811618b17f5c69a3116"],"c:/algorithm.js/dist/utils/algorithms/fibonacci.js":[317,1652604914577.724,"9ae1be2462fbbac88d9edd296ed1c10c252974b6038fd98c84b1baca184a9944"],"c:/algorithm.js/dist/utils/algorithms/fourier-transform.js":[328,1652603422347.2212,"edd6b4bfa3c23ca07e01fc20b742512a7c5beb8accab6602a41187feaf914e9b"],"c:/algorithm.js/dist/utils/algorithms/heap-sort.js":[1145,1652604914578.724,"5ec53dfcc23630a6607f4ade42895d4609420022290c4106c5f952d55447b212"],"c:/algorithm.js/dist/utils/algorithms/insertion-sort.js":[670,1652604914579.7263,"9f17a046b5c4b1fe1a213e95ad718c9d9210e74bc7b5bec2de0083ec36411742"],"c:/algorithm.js/dist/utils/algorithms/linear-search.js":[511,1652604914580.7239,"3bd1f126b1e1dc470ddace0c42336db3a967f4b6bc706e9079ab605fb69ecf24"],"c:/algorithm.js/dist/utils/algorithms/merge-sort.js":[828,1652604914581.725,"d0e07d94ac686d1245417920a9bb53faa39c4e730a7103a99ed021c33c7a83ec"],"c:/algorithm.js/dist/utils/algorithms/patience-sort.js":[1820,1652604914583.7205,"563ba951e773b17311e14b0c3237b74b5e56cf887edc095b5a8a3405b02e3e47"],"c:/algorithm.js/dist/utils/algorithms/quick-sort.js":[865,1652604914584.7236,"815bafd5ad907e6788d45c6e83892cfc71b3c7e8c7fbecc929be5e4e93d9b187"],"c:/algorithm.js/dist/utils/algorithms/radix-sort.js":[759,1652604914585.721,"5bf79d33c8d28d0c4579000e768518dc376556c1bd66441a3ae962292f49d394"],"c:/algorithm.js/dist/utils/algorithms/recursive-traversal-binary-tree.js":[596,1652546465547.939,"99e5812219437d571535277bb5ce57e151ca1f57590a5fef25ad740f0568d9a3"],"c:/algorithm.js/dist/utils/algorithms/selection-sort.js":[778,1652604914586.7214,"6984012202dbe115e662c11bb163123aabaf6ee10b1d7e937f2d55d777b1153f"],"c:/algorithm.js/dist/utils/algorithms/shell-sort.js":[752,1652604914587.7244,"ecec55afae5d936d6a875fc4b60e01434d81596a1a7220419fa571dbe054deef"],"c:/algorithm.js/dist/utils/data-structures/binary-tree.js":[6777,1652604914589.7212,"9a5dc07bd7ff42debe2f291f3b44313433621aa7214e56a3cabc2b8894e587f9"],"c:/algorithm.js/dist/utils/data-structures/bloom-filter.js":[55,1652526263109.2373,"47b95440e13f3441f4d37b12bb91e3a57f6e14c137cb2df42356cd019390ee0b"],"c:/algorithm.js/dist/utils/data-structures/graph.js":[3775,1652604914590.7246,"8b798dd6dc7949f32384151cc30f8af220f75f989d1454d39866399a0b650878"],"c:/algorithm.js/dist/utils/data-structures/hash-table.js":[2079,1652604914591.7197,"12b407671164db6d5bb9d5dac69a31deb946d25ebc586b1b52bf69e93ee3f23d"],"c:/algorithm.js/dist/utils/data-structures/heap.js":[651,1652604914592.7234,"1c3c6917bfad1fb29474f2c83ceb617c5e2f9e1933e12e00972f73ab243ac695"],"c:/algorithm.js/dist/utils/data-structures/linked-list.js":[3682,1652604914562.7236,"7918c7706ea9f2954f79b2abaf0f2225582e5101f1ee768c28a7dd8fca6c5f2f"],"c:/algorithm.js/dist/utils/data-structures/priority-queue.js":[1557,1652604914563.72,"332bc8eaad403c8fb861735c8202eea0781d0a354cdd773ff60996396003a484"],"c:/algorithm.js/dist/utils/data-structures/queue.js":[799,1652604914559.7249,"0808cf68a585fcd8f2e33933a5626fa3c6ffbe41408b4be433f25ecb4c640b28"],"c:/algorithm.js/dist/utils/data-structures/red-black-tree.js":[57,1652604914593.724,"517ca67cfef330039267d806b800ff8b2e7e604c63e37df5a30f65eee36c2795"],"c:/algorithm.js/dist/utils/data-structures/stack.js":[794,1652604914558.7249,"7f53cadeb34cda866a9bd70063dea862d07c725dacaaf16150faacb07397f42f"],"c:/algorithm.js/dist/utils/data-structures/tree.js":[6770,1652546465523.9404,"bc7b4f3f59253672a1e441e6afac830a275986ea9203a403f5b61f124ee5075f"],"c:/algorithm.js/dist/utils/interfaces/algorithm.enum.js":[144,1652604914571.724,"7abe7ad9ac8739d17bc81c2d377a45c6a37e18d256b450e609aae88ae6baaea5"],"c:/algorithm.js/dist/utils/interfaces/big-o-notation.enum.js":[126,1652604914565.724,"c902049919b27aed7569049b9b1c0c2ca190875dffca58b9480e556bbbe8d58c"],"c:/algorithm.js/dist/utils/interfaces/data-structure.enum.js":[126,1652604914560.7244,"c36d4a6065fe23a43dd5dd18c9a7207e92651bb70f9f1dcd21884f4e757e2a91"],"c:/algorithm.js/lib/utils/algorithms/binary-search.ts":[656,1652478416782.7903,"10cc631a81c940d23b6f61ba1fb3ef51b199d7e07ff794a11733a60677dfca76"],"c:/algorithm.js/lib/utils/algorithms/bubble-sort.ts":[585,1652515904761.2727,"6590f39e1a16094f14db1c202719e9d85caf475297bf4bcbf0c881da922c4767"],"c:/algorithm.js/lib/utils/algorithms/bucket-sort.ts":[496,1652515946756.3699,"40911080191b57150c5b6d35b557c70980497701feb09eba9d23b7a8fca6d051"],"c:/algorithm.js/lib/utils/algorithms/counting-sort.ts":[759,1652544120076.206,"afd9b224c4127ae317f94365ae6153a170876442a953c8ca3d3a8f42da55d013"],"c:/algorithm.js/lib/utils/algorithms/cycle-sort.ts":[1274,1652546026076.3557,"906356b9e1d8d15c9f8786f1727523ee81cb1e9de33a7298d27061e4a50b747b"],"c:/algorithm.js/lib/utils/algorithms/dijstras-algorithm.ts":[166,1652601699653.7822,"56492cf07d35f90081f178e1b23d9804fdc92410a04f2252d52c752b8b0ea3ea"],"c:/algorithm.js/lib/utils/algorithms/fibonacci.ts":[176,1652426624306.4624,"c1ac7b3de1da0defa230e6f25a5c22c12abdd3ce788454068f0edfc8db032feb"],"c:/algorithm.js/lib/utils/algorithms/heap-sort.ts":[1065,1652545060292.04,"8113a417323e938e94be1b1b8e6b41aaf9beb79c8fe09315c8be62b72419aba0"],"c:/algorithm.js/lib/utils/algorithms/insertion-sort.ts":[559,1652546667508.621,"7be181a3d4056822614d5e0443264e7a1b78fc1432116cf3103b6cf92a6b53b2"],"c:/algorithm.js/lib/utils/algorithms/linear-search.ts":[373,1652545314998.0637,"23936973446731800ac6df048a66aca2e5831b2b8d03e2793aec72edf9e2dff4"],"c:/algorithm.js/lib/utils/algorithms/merge-sort.ts":[792,1652546100850.2915,"296b01be84b0a9e13555904dfc0a5343cf806a50a02af23c7a4f02a2932fa8bd"],"c:/algorithm.js/lib/utils/algorithms/patience-sort.ts":[1524,1652546519664.9873,"094cbcc7468a1cbadcead375c5d5272d299eb63c81550035eed179b3f33730e0"],"c:/algorithm.js/lib/utils/algorithms/quick-sort.ts":[722,1652546363248.9053,"2d7dfcfcbfb4df5ef83b602010fb9b4f25cb590324fb4714a7a38b8effffa203"],"c:/algorithm.js/lib/utils/algorithms/radix-sort.ts":[661,1652546580389.955,"ea3aa12d99d570f0b220429a77d0be628a91956ea59b37b6f5a63763c42512dd"],"c:/algorithm.js/lib/utils/algorithms/selection-sort.ts":[645,1652515889911.3262,"84c10617d1fa8d836be1da2efa19a0b1d3bec4b0f0e3519dc4dbbff9e2fbed67"],"c:/algorithm.js/lib/utils/algorithms/shell-sort.ts":[635,1652546618285.6382,"fa9c93e2d38a44d5bc30244a9682fbbba0c1f958e7c896b2519dfa693714cff4"],"c:/algorithm.js/lib/utils/data-structures/binary-tree.ts":[6088,1652600385473.089,"055aebbf55c5997936ab934846f48f732b5ced514bf18a75c4501c38d984d93f"],"c:/algorithm.js/lib/utils/data-structures/graph.ts":[3652,1652604934412.1975,"5abc283454adb32409722910c1aa9f1c64bebe38c24f3929e7732541a758d56e"],"c:/algorithm.js/lib/utils/data-structures/hash-table.ts":[2047,1652600253630.7844,"f68bc1d5bbfcca73855f50d6908ff666a5919b20773c5b9ca547704b42d6ddcc"],"c:/algorithm.js/lib/utils/data-structures/heap.ts":[667,1652540858306.4258,"40cc505b43c1c50ea434687d87ae6270cb943e43b3af8f55594ff60f3bb79c44"],"c:/algorithm.js/lib/utils/data-structures/linked-list.ts":[3151,1652600172700.0603,"5e5d619eadf678322be4a59851f87eb842f027eb0984b4d5aff8ad455548522d"],"c:/algorithm.js/lib/utils/data-structures/priority-queue.ts":[1544,1652600283205.9548,"ae63872b8bd2a7b7edd54c9c9c413011f94b59bb0d1cfd756196069a97379b93"],"c:/algorithm.js/lib/utils/data-structures/queue.ts":[760,1652600056901.8577,"3ba5df477eb8bbd1157ebade6b2c932f7ac2446b2daacf780f930a728269b32c"],"c:/algorithm.js/lib/utils/data-structures/red-black-tree.ts":[0,1652540919314.719,"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"],"c:/algorithm.js/lib/utils/data-structures/stack.ts":[710,1652599644588.1558,"fbe6edf3d5c6f5080bfd626a9a5a71d57b1ce3bcde4a533be6361f1463d2a899"],"c:/algorithm.js/lib/utils/interfaces/algorithm.enum.ts":[549,1652604653080.4387,"980802ce133980c957041cc1d7cb59642f568e4b2dfc2cd3c095b5a7d4be1f11"],"c:/algorithm.js/lib/utils/interfaces/big-o-notation.enum.ts":[185,1652526128412.667,"ad5520b29988d28d6ae3d51a3c6a29376a761527568f384ccb4cb73bf97de80c"],"c:/algorithm.js/lib/utils/interfaces/data-structure.enum.ts":[315,1652604674464.8264,"b3300f63275f3daee9bd7cd5202c4ad9e1ee826be96ed18f4d0cc5a1343b3d54"],"c:\\algorithm.js\\lib\\utils\\data-structures\\graph.ts":[3602,1652620069271.9065,"32287c8b157d73d8b2c1672b62df9a37f90d4e72d6c1c5a2bf5f2402a78b8617"],"c:\\algorithm.js\\lib\\utils\\algorithms\\dijstras-algorithm.ts":[158,1652619666954.173,"ceab217ecc0cb6c2d1816294616ddb84517b4d6bf8eb543f740658ee53f6f655"],"c:\\algorithm.js\\dist\\utils\\data-structures\\graph.js":[3735,1652620058946.8992,"96f2f1450f7549be78ec45dc7dabc7a6e05da3e5e69c7b99780407192723a5a5"]}

.github/workflows/release.yml

@@ -18,6 +18,18 @@ jobs:
       - name: Checkout nodejs
       - uses: actions/checkout@v2
 
+      - name: Run Snyk to check for vulnerabilities
+        uses: snyk/actions/node@master
+        continue-on-error: true
+        env:
+          SNYK_TOKEN: ${{ secrets.SNYK_TOKEN }}
+        with:
+          args: --sarif-file-output=snyk.sarif
+      - name: Upload result to GitHub Code Scanning
+        uses: github/codeql-action/upload-sarif@v1
+        with:
+          sarif_file: snyk.sarif
+
       - name: Check cache
         uses: actions/[email protected]
 

README.md

@@ -31,15 +31,16 @@ I noticed that we (JS) do not have a normal LIBRARY for using algorithms, for ex
   npm i algroithm.js
 ```
 
-```ts
-import { Algorithm, DataStructure, BigONotation } from 'algorithm.js';
+```js
+const { Algorithm, DataStructure, BigONotation } = require('algorithm.js');
 
 const linearSearch = new Algorithm().create('LINEAR-SEARCH');
 const stack = new DataStructure().create('STACK');
-const linearTime = new BigONotation().create('LINEAR');
+const linearTime = new BigONotation().create('LINEAR-TIME');
 
-linearSearch.run([1, 2, 4, 7, 10, 23, 26, 30, 45]);
-linearTime.check(linearSearch.run()); // N(O) = 8
+const ls = linearSearch.run([1, 2, 4, 7, 10, 23, 26, 30, 45]);
+
+linearTime.check(ls.count); // N(O) = 8
 
 stack.add(10);
 stack.add(200);