|Bin packing problem|
Calculator solves bin packing problem by different heuristic algorithms. Created at the request of the user.
|Bin packing problem 2|
Calculator solves bin packing problem with different heuristic algorithms and gives you a best. Created at the user's request.
This online calculator measures the Levenshtein distance between two strings.
This online calculator generates Huffman coding based on a set of symbols and their probabilities. A brief description of Huffman coding is below the calculator.
|Tips and tricks #8: How to reuse existing calculator|
This article describes process of reusing another calculator's logic (algorithm) in your calculator.
|Squarefree polynomial factorization|
The calculator extracts square factors from the input polynomial.
|Is a point in a triangle?|
The calculator determines if an arbitrary point lies inside 2D triangle. The triangle is defined by 3 cartesian coordinate pairs.
This online calculator generates Shannon coding based on a set of symbols and their probabilities
|Shannon-Fano coding calculator|
This online calculator generates Shannon-Fano coding based on a set of symbols and their probabilities
|Polynomial power expansion|
The calculator expands n-th power of a given polynomial.
This online calculator computes the convex hull of a given set of points using Jarvis march algorithm, aka Gift wrapping algorithm
|2D Bin Packing Problem Solver|
This online calculator tries to solve an offline two-dimensional (2D) bin packing problem using Maximal Rectangles heuristic algorithm
This calculator compresses/decompresses a sting using Lempel-Ziv-Welch (LZW) algorithm.