Algorithms code bricks in JavaScript. This is a child project of js-library and the twin project of js-data-structures.
This project is just a playground for any algorithm that doesn't fit in any of those project,
- aureooms/js-cg : computational geometry code bricks for JavaScript
- aureooms/js-complex : complex numbers code bricks for JavaScript
- aureooms/js-equation : equations system code bricks for JavaScript
- aureooms/js-fft : fast Fourier transform code bricks for JavaScript
- aureooms/js-fibonacci : Fibonacci numbers code bricks for JavaScript
- aureooms/js-gn : graphs and networks code bricks for JavaScript
- aureooms/js-hash : hashing algorithms code bricks for JavaScript
- aureooms/js-ho : heuristic optimization code bricks for JavaScript
- aureooms/js-hypermatrix : hypermatrices code bricks for JavaScript
- aureooms/js-integer : multi-precision arithmetic code bricks for JavaScript
- aureooms/js-matrix : matrices code bricks for JavaScript
- aureooms/js-nlp : natural language processing code bricks for JavaScript
- aureooms/js-oro : operations research and optimization algorithm templates for JavaScript
- aureooms/js-permutation : permutations code bricks for JavaScript
- aureooms/js-pfsp-wt : permutation flow-shop problem (PFSP) with weighted tardiness objective (PFSP-WT) code bricks for JavaScript
- aureooms/js-polynomial : sparse and dense polynomials code bricks for JavaScript
- aureooms/js-prime : prime numbers code bricks for JavaScript
- aureooms/js-random : randomness code bricks for JavaScript
- aureooms/js-rational : rational numbers code bricks for JavaScript
- aureooms/js-search : item retrieval code bricks for JavaScript
- aureooms/js-splitting: splitting code bricks for JavaScript
- aureooms/js-sort : sorting code bricks for JavaScript
- aureooms/js-in-situ-sort-spec: in place sorting code bricks for JavaScript
- aureooms/js-heapsort: heapsort code bricks for JavaScript
- aureooms/js-quicksort: quicksort code bricks for JavaScript
- aureooms/js-mergesort: mergesort code bricks for JavaScript
- aureooms/js-merging: merging code bricks for JavaScript
- aureooms/js-partition: partition code bricks for JavaScript
- aureooms/js-selection: selection code bricks for JavaScript
- aureooms/js-in-situ-sort-spec: in place sorting code bricks for JavaScript
- aureooms/js-string : character sequence code bricks for JavaScript
Those packages aim to provide code bricks that are as generic as possible. Some examples are a Gauss-Jordan method that can work with any number model, a Karatsuba algorithm that can handle any block size, a Graham Scan algorithm that works with clockwise or counter clockwise ordering, and a Monotone Chain algorithm that can be used as a triangulation algorithm without any change.
A list of links and projects focusing on algorithm implementation.
- https://github.com/felipernb/algorithms.js
- https://github.com/mgechev/javascript-algorithms
- https://github.com/nzakas/computer-science-in-javascript
- http://www.nayuki.io
- https://github.com/xtaci/algorithms (C++)
- https://github.com/fragglet/c-algorithms (C)
- https://github.com/nryoung/algorithms (Python)
- https://github.com/kanwei/algorithms (Ruby)
- https://github.com/phishman3579/java-algorithms-implementation (Java)
- https://github.com/patmorin/ods (C++, Java, Python)
- http://www.nayuki.io (C, C++, Java, C#, Python, Haskell, MATLAB and others)
- http://rosettacode.org (All kinds of languages)