🚀 Algorithms

Playground for algorithms in JavaScript. This is a child project of js-library and the twin project of js-data-structures.

📰 Description

This project is just a playground for any algorithm that doesn't fit in any of those projects,

🔦 Searching

@aureooms/js-search:
Searching algorithms for JavaScript

🌖 Merging

aureooms/js-merging: merging for JavaScript

🍰 Partitioning

@aureooms/js-partition:
Partitioning algorithms for JavaScript
@aureooms/js-splitting:
Array splitting algorithms for JavaScript

👇 Selection

aureooms/js-selection: selection for JavaScript

📶 Sorting

@aureooms/js-sort:
Sorting algorithms for JavaScript

⚖️ Comparison sorting

📔 @comparison-sorting/specification: Comparison sorting specification for JavaScript
🍃 @comparison-sorting/heap-sort: Heapsort for JavaScript
🐇 @comparison-sorting/quick-sort: Quicksort for JavaScript
⏪ @comparison-sorting/insertion-sort: Insertion sorting algorithms for JavaScript
🤺 @comparison-sorting/merge-insertion-sort: Ford-Johnson algorithm for JavaScript
🐉 @comparison-sorting/merge-sort: Mergesort for JavaScript
🎼 @comparison-sorting/odd-even-merge-sort: Batcher's odd-even mergesort for JavaScript

💤 Integer sorting

🍢 @integer-sorting/radix-sort: Radix sorting algorithms for JavaScript
aureooms/js-countingsort: countingsort for JavaScript
aureooms/js-bucketsort: bucketsort for JavaScript

🔣 Strings

Nothing yet.

🔪 Hashing

Nothing yet.

📐 Geometry

@aureooms/js-cg : computational geometry code bricks for JavaScript

🌐 Graphs

@aureooms/js-gn : graphs and networks code bricks for JavaScript
🍢 @graph-algorithm/topological-sorting:
Topological sorting algorithms for Javascript
💇‍♀️ @graph-algorithm/minimum-cut:
Minimum cut algorithms for JavaScript
🌼 @graph-algorithm/maximum-matching:
Maximum matching algorithms for JavaScript

🔢 Numbers

💤 @aureooms/js-integer :
Integers for JavaScript ()
👩‍🌾 @aureooms/js-rational-field : Rational field for JavaScript ()

🔣 Arithmetic

🐘 @aureooms/js-integer-big-endian: Arbitrary precision arithmetic for integers in big-endian order for JavaScript
🍕 @aureooms/js-rational : rational numbers code bricks for JavaScript
🧜‍♀️ @aureooms/js-modular-arithmetic: Modular arithmetic for JavaScript.
🌐 @aureooms/js-complex : complex numbers code bricks for JavaScript
〰️ @aureooms/js-polynomial : sparse and dense polynomials code bricks for JavaScript

2️⃣ 3️⃣ 5️⃣ 7️⃣ Number theory

🦋 @aureooms/js-fft : Fast Fourier transform algorithms for JavaScript
@aureooms/js-prime : Prime numbers for JavaScript

🐚 Integer sequences

@aureooms/js-integer-sequences : Integer sequences for JavaScript
@aureooms/js-fibonacci : Fibonacci numbers for JavaScript

🎲 Randomness

@randomized/random: Randomness algorithms for JavaScript
@entropy-source/pseudo-random : Pseudorandom number generators for JavaScript

🧠 Hard problems

😆 @aureooms/js-sat : Boolean formula satisfiability algorithms for Javascript
🎒 @aureooms/js-knapsack :
Knapsack problem algorithms for JavaScript
🧪 @aureooms/js-metaheuristics :
Metaheuristic algorithms for JavaScript

↔️ Sytems of equalities and inequalities

@aureooms/js-equation : equations system code bricks for JavaScript

🧹 Combinatorics

❗ @combinatorics/factorial: Factorial function for JavaScript
💺 @combinatorics/permutation: Permutations library for JavaScript
🦓 @combinatorics/n-permutations: Set n-permutations for JavaScript
🦛 @combinatorics/n-combinations: Set n-combinations for JavaScript
🦏 @combinatorics/n-multicombinations: Set n-multicombinations for JavaScript
🍱 @combinatorics/set-partition: Set partition algorithms 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 input 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.