Algorithms Example

This repository contains examples of various algorithms which were written on different programming languages..

Implemented algorithms with languages:

Language	Java	Python	Rust	C	C++	JavaScript	Go	C#	Ruby
A*Search					👍
BellmanFord	👍				👍
BestFirstSearch	👍
BinarySearch	👍	👍			👍	👍	👍
Bitap Algorithm					👍
BreadthFirstSearch	👍	👍		👍
BubbleSort	👍	👍	👍	👍	👍	👍
CountingSort					👍
DepthFirstSearch					👍
Dijkstra's	👍				👍
Doomsday	👍					👍
ElevatorAlgorithm	👍
Fast Fourier Transform					👍
Fibonacci	👍	👍		👍			👍
FisherYatesShuffle	👍				👍			👍
Floyd'sAlgorithm		👍			👍
GreatestCommonDivisor	👍			👍
HeapSort	👍				👍	👍	👍		👍
HistogramEqualization	👍
InsertionSort	👍	👍	👍				👍	👍
Inverse Fast Fourier Transform					👍
Johnson algorithm					👍
Kadane's algorithm	👍	👍			👍	👍	👍
LinearSearch	👍	👍			👍	👍
Longest-Common-Subsequence	👍	👍			👍				👍
Longest-Increasing-Subsequence	👍
LongestPath					👍
MergeSort	👍	👍		👍	👍	👍	👍
MiniMaxWithABPruning	👍
Modified_Binary_Search				👍
Postman Sort				👍
Quick Sort	👍	👍				👍	👍	👍	👍
Uniform-cost search	👍					👍	👍
RadixSort	👍	👍			👍
RobinCarp	👍
SelectionSort	👍	👍		👍	👍	👍	👍		👍
ShellSort	👍	👍			👍
SieveofEratosthenes	👍	👍			👍
UnaryCoding	👍	👍				👍
TernarySearch					👍
Topological Sort					👍

List of Algorithms :

• Brent's algorithm : finds a cycle in function value iterations using only two iterators

• Floyd's cycle-finding algorithm : finds a cycle in function value iterations

• Gale–Shapley algorithm : solves the stable marriage problem

• Coloring algorithm : Graph coloring algorithm.

• Hopcroft–Karp algorithm : convert a bipartite graph to a maximum cardinality matching

• Hungarian algorithm : algorithm for finding a perfect matching

• Prüfer coding : conversion between a labeled tree and its Prüfer sequence Tarjan's off-line least common

• ancestors algorithm : compute lowest common ancestors for pairs of nodes in a tree

• Topological sort : finds linear order of nodes (e.g. jobs) based on their dependencies.

• Girvan–Newman algorithm : detect communities in complex systems

• Dinic's algorithm : is a strongly polynomial algorithm for computing the maximum flow in a flow network.

• Edmonds–Karp algorithm : implementation of Ford–Fulkerson

• Ford–Fulkerson algorithm : computes the maximum flow in a graph

• Karger's algorithm : a Monte Carlo method to compute the minimum cut of a connected graph

• Push–relabel algorithm : computes a maximum flow in a graph

• Euclidean minimum spanning tree : algorithms for computing the minimum spanning tree of a set of points in the plane

• Euclidean shortest path problem : find the shortest path between two points that does not intersect any obstacle

• Longest path problem : find a simple path of maximum length in a given graph

• Bellman–Ford algorithm : computes shortest paths in a weighted graph (where some of the edge weights may be negative)

• Dijkstra's algorithm : computes shortest paths in a graph with non-negative edge weights

• Floyd–Warshall algorithm : solves the all pairs shortest path problem in a weighted, directed graph

• Johnson algorithm : All pairs shortest path algorithm in sparse weighted directed graph

• Warnsdorff's algorithm : A heuristic method for solving the Knight's Tour problem.

  • A : special case of best-first search that uses heuristics to improve speed

  • B : a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals)

• Backtracking : abandons partial solutions when they are found not to satisfy a complete solution

• Beam search : is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement

• Beam stack search : integrates backtracking with beam search

• Best-first search : traverses a graph in the order of likely importance using a priority queue

• Bidirectional search : find the shortest path from an initial vertex to a goal vertex in a directed graph

• Bloom filter : a constant time and memory check to see whether a given element exists in a set. May return a false positive, but never a false negative.

• Breadth-first search : traverses a graph level by level

• Brute-force search : An exhaustive and reliable search method, but computationally inefficient in many applications.

  • D : an incremental heuristic search algorithm

  • Depth-first search : traverses a graph branch by branch

  • Dijkstra's algorithm : A special case of A for which no heuristic function is used

  • General Problem Solver : a seminal theorem-proving algorithm intended to work as a universal problem solver machine.

  • Jump point search : An optimization to A which may reduce computation time by an order of magnitude using further heuristics.

• Uniform-cost search : a tree search that finds the lowest cost route where costs vary

• SSS : state space search traversing a game tree in a best-first fashion similar to that of the A* search algorithm

• Bron–Kerbosch algorithm : a technique for finding maximal cliques in an undirected graph

• MaxCliqueDyn maximum clique algorithm : find a maximum clique in an undirected graph

• Bitap algorithm : fuzzy algorithm that determines if strings are approximately equal.

• Daitch–Mokotoff Soundex : a Soundex refinement which allows matching of Slavic and Germanic surnames

• Double Metaphone : an improvement on Metaphone

• Match Rating Approach : a phonetic algorithm developed by Western Airlines

• Metaphone : an algorithm for indexing words by their sound, when pronounced in English

• NYSIIS : phonetic algorithm, improves on Soundex

• Soundex : a phonetic algorithm for indexing names by sound, as pronounced in English

• Hamming distance : sum number of positions which are different Jaro–Winkler distance : is a measure of similarity between two strings

• Levenshtein edit distance : compute a metric for the amount of difference between two sequences

• Trigram search : search for text when the exact syntax or spelling of the target object is not precisely known

• Linear search : finds an item in an unsorted sequence Selection algorithm : finds the kth largest item in a sequence

• Ternary search : a technique for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa

• Binary search algorithm : locates an item in a sorted sequence

• Fibonacci search technique : search a sorted sequence using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers

• Predictive search : binary-like search which factors in magnitude of search term versus the high and low values in the search. Sometimes called dictionary search or interpolated search.

• Uniform binary search : an optimization of the classic binary search algorithm

• Schensted algorithm : constructs a pair of Young tableaux from a permutation

• Heap's permutation generation algorithm : interchange elements to generate next permutation

• Dynamic time warping : measure similarity between two sequences which may vary in time or speed

• Hirschberg's algorithm : finds the least cost sequence alignment between two sequences, as measured by their Levenshtein distance

• Needleman–Wunsch algorithm : find global alignment between two sequences

• Smith–Waterman algorithm : find local sequence alignment

• Bubble sort : for each pair of indices, swap the items if out of order

• Quicksort : divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice

• Introsort : begin with quicksort and switch to heapsort when the recursion depth exceeds a certain level

• Timsort : adaptative algorithm derived from merge sort and insertion sort. Used in Python 2.3 and up, and Java SE 7.

• Insertion sort : determine where the current item belongs in the list of sorted ones, and insert it there

• Shell sort : an attempt to improve insertion sort

• Cycle sort : in-place with theoretically optimal number of writes

• Merge sort : sort the first and second half of the list separately, then merge the sorted lists

• Burstsort : build a compact, cache efficient burst trie and then traverse it to create sorted output

• Postman sort : variant of Bucket sort which takes advantage of hierarchical structure

• Radix sort : sorts strings letter by letter

• Heapsort : convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list

• Selection sort : pick the smallest of the remaining elements, add it to the end of the sorted list

• Kadane's algorithm : finds maximum sub-array of any size

• Longest common subsequence problem : Find the longest subsequence common to all sequences in a set of sequences

• Longest increasing subsequence problem : Find the longest increasing subsequence of a given sequence

• Longest common substring problem : find the longest string (or strings) that is a substring (or are substrings) of two or more strings

• Aho–Corasick string matching algorithm : trie based algorithm for finding all substring matches to any of a finite set of strings

• Boyer–Moore string search algorithm : amortized linear (sublinear in most times) algorithm for substring search

• Boyer–Moore–Horspool algorithm : Simplification of Boyer–Moore

• Knuth–Morris–Pratt algorithm : substring search which bypasses reexamination of matched characters

• Rabin–Karp string search algorithm : searches multiple patterns efficiently

• Zhu–Takaoka string matching algorithm : a variant of the Boyer–Moore

• Ukkonen's algorithm : a linear-time, online algorithm for constructing suffix trees

• Chien search : a recursive algorithm for determining roots of polynomials defined over a finite field

• Schreier–Sims algorithm : computing a base and strong generating set (BSGS) of a permutation group

• Todd–Coxeter algorithm : Procedure for generating cosets.

• Buchberger's algorithm : finds a Gröbner basis

• Cantor–Zassenhaus algorithm : factor polynomials over finite fields

• Faugère F4 algorithm : finds a Gröbner basis (also mentions the F5 algorithm)

• Gosper's algorithm : find sums of hypergeometric terms that are themselves hypergeometric terms

• Knuth–Bendix completion algorithm : for rewriting rule systems

• Multivariate division algorithm : for polynomials in several indeterminates

• Polynomial long division : an algorithm for dividing a polynomial by another polynomial of the same or lower degree

• Risch algorithm : an algorithm for the calculus operation of indefinite integration (i.e. finding antiderivatives)

• Closest pair problem : find the pair of points (from a set of points) with the smallest distance between them

• Cone algorithm : identify surface points

• Geometric hashing : a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation

• Gilbert–Johnson–Keerthi distance algorithm : determining the smallest distance between two convex shapes.

• Jump-and-Walk algorithm : an algorithm for point location in triangulations

• Laplacian smoothing : an algorithm to smooth a polygonal mesh

• Minimum bounding box algorithms : find the oriented minimum bounding box enclosing a set of points

• Nearest neighbor search : find the nearest point or points to a query point

• Rotating calipers : determine all antipodal pairs of points and vertices on a convex polygon or convex hull.

• Shoelace algorithm : determine the area of a polygon whose vertices are described by ordered pairs in the plane

• Chew's second algorithm : create quality constrained Delaunay triangulations

• Marching triangles : reconstruct two-dimensional surface geometry from an unstructured point cloud

• Bowyer–Watson algorithm : create voronoi diagram in any number of dimensions

• Fortune's Algorithm : create voronoi diagram

• Binary GCD algorithm : Efficient way of calculating GCD.

• Chakravala method : a cyclic algorithm to solve indeterminate quadratic equations, including Pell's equation

• Euclidean algorithm : computes the greatest common divisor

• Extended Euclidean algorithm : Also solves the equation ax + by = c.

• Odlyzko–Schönhage algorithm : calculates nontrivial zeroes of the Riemann zeta function

• Borwein's algorithm : an algorithm to calculate the value of 1/π

• Gauss–Legendre algorithm : computes the digits of pi

• Bailey–Borwein–Plouffe formula : (BBP formula) a spigot algorithm for the computation of the nth binary digit of π

• Newton–Raphson division : uses Newton's method to find the reciprocal of D, and multiply that reciprocal by N to find the final quotient Q.

• BKM algorithm : compute elementary functions using a table of logarithms

• CORDIC : compute hyperbolic and trigonometric functions using a table of arctangents

• Exponentiating by squaring : an algorithm used for the fast computation of large integer powers of a number

• Montgomery reduction : an algorithm that allows modular arithmetic to be performed efficiently when the modulus is large

• Booth's multiplication algorithm : a multiplication algorithm that multiplies two signed binary numbers in two's complement notation

• Fürer's algorithm : an integer multiplication algorithm for very large numbers possessing a very low asymptotic complexity

• Karatsuba algorithm : an efficient procedure for multiplying large numbers

• Schönhage–Strassen algorithm : an asymptotically fast multiplication algorithm for large integers

• Toom–Cook multiplication : (Toom3) a multiplication algorithm for large integers

• Rounding functions : the classic ways to round numbers

• Spigot algorithm : A way to compute the value of a mathematical constant without knowing preceding digits

• Alpha max plus beta min algorithm : an approximation of the square-root of the sum of two squares

• Shifting nth-root algorithm : digit by digit root extraction

• Binary splitting : a divide and conquer technique which speeds up the numerical evaluation of many types of series with rational terms

• Kahan summation algorithm : a more accurate method of summing floating-point numbers

• Filtered back-projection : efficiently compute the inverse 2-dimensional Radon transform.

• Birkhoff interpolation : an extension of polynomial interpolation

• Lagrange interpolation : interpolation using Lagrange polynomials

• Linear interpolation : a method of curve fitting using linear polynomials

• Monotone cubic interpolation : a variant of cubic interpolation that preserves monotonicity of the data set being interpolated.

• Bilinear interpolation : an extension of linear interpolation for interpolating functions of two variables on a regular grid

• Pareto interpolation : a method of estimating the median and other properties of a population that follows a Pareto distribution.

• De Boor algorithm : B-splines

• De Casteljau's algorithm : Bézier curves

• Gram–Schmidt process : orthogonalizes a set of vectors

• Cannon's algorithm : a distributed algorithm for matrix multiplication especially suitable for computers laid out in an N × N mesh

• Coppersmith–Winograd algorithm : square matrix multiplication

• Freivalds' algorithm : a randomized algorithm used to verify matrix multiplication

• Strassen algorithm : faster matrix multiplication

• Biconjugate gradient method : solves systems of linear equations

• Conjugate gradient : an algorithm for the numerical solution of particular systems of linear equations

• Gauss–Jordan elimination : solves systems of linear equations

• Gauss–Seidel method : solves systems of linear equations iteratively

• Levinson recursion : solves equation involving a Toeplitz matrix

• Stone's method : also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations

• Cuthill–McKee algorithm : reduce the bandwidth of a symmetric sparse matrix

• Minimum degree algorithm : permute the rows and columns of a symmetric sparse matrix before applying the Cholesky decomposition

• Symbolic Cholesky decomposition : Efficient way of storing sparse matrix

• Gibbs sampling : generate a sequence of samples from the joint probability distribution of two or more random variables

• Hybrid Monte Carlo : generate a sequence of samples using Hamiltonian weighted Markov chain Monte Carlo, from a probability distribution which is difficult to sample directly.

• Metropolis–Hastings algorithm : used to generate a sequence of samples from the probability distribution of one or more variables

• Wang and Landau algorithm : an extension of Metropolis–Hastings algorithm sampling

• MISER algorithm : Monte Carlo simulation, numerical integration

• False position method : approximates roots of a function

• Newton's method : finds zeros of functions with calculus

• Halley's method : uses first and second derivatives

• Secant method : 2-point, 1-sided

• Ridder's method : 3-point, exponential scaling

• Muller's method : 3-point, quadratic interpolation

• Alpha-beta pruning : search to reduce number of nodes in minimax algorithm

• Bruss algorithm : see odds algorithm

• Hungarian method : a combinatorial optimization algorithm which solves the assignment problem in polynomial time

• Chaff algorithm : an algorithm for solving instances of the boolean satisfiability problem

• Davis–Putnam algorithm : check the validity of a first-order logic formula

• Algorithm X : a nondeterministic algorithm

• Dancing Links : an efficient implementation of Algorithm X

• Cross-entropy method : a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling

• Dynamic Programming : problems exhibiting the properties of overlapping subproblems and optimal substructure

• Ellipsoid method : is an algorithm for solving convex optimization problems

• Bees algorithm : a search algorithm which mimics the food foraging behavior of swarms of honey bees

• golden section search : an algorithm for finding the maximum of a real function

• Benson's algorithm : an algorithm for solving linear vector optimization problems

• Dantzig–Wolfe decomposition : an algorithm for solving linear programming problems with special structure

• Karmarkar's algorithm : The first reasonably efficient algorithm that solves the linear programming problem in polynomial time.

• Simplex algorithm : An algorithm for solving linear programming problems

• Best Bin First : find an approximate solution to the Nearest neighbor search problem in very-high-dimensional spaces

• BFGS method : A nonlinear optimization algorithm

• Gauss–Newton algorithm : An algorithm for solving nonlinear least squares problems.

• Levenberg–Marquardt algorithm : An algorithm for solving nonlinear least squares problems.

• Doomsday algorithm : day of the week

• Kabsch algorithm : calculate the optimal alignment of two sets of points in order to compute the root mean squared deviation between two protein structures.

• Velvet : a set of algorithms manipulating de Bruijn graphs for genomic sequence assembly

• Sorting by signed reversals : an algorithm for understanding genomic evolution.

• Maximum parsimony (phylogenetics) : an algorithm for finding the simplest phylogenetic tree to explain a given character matrix.

• UPGMA : a distance-based phylogenetic tree construction algorithm.

• Vincenty's formulae : a fast algorithm to calculate the distance between two latitude/longitude points on an ellipsoid

• Lesk algorithm : word sense disambiguation

• Stemming algorithm : a method of reducing words to their stem, base, or root form

• Sukhotin's algorithm : a statistical classification algorithm for classifying characters in a text as vowels or consonants

• Constraint algorithm : a class of algorithms for satisfying constraints for bodies that obey Newton's equations of motion

• Demon algorithm : a Monte Carlo method for efficiently sampling members of a microcanonical ensemble with a given energy

• Featherstone's algorithm : compute the effects of forces applied to a structure of joints and links

• Barnes–Hut simulation : Solves the n-body problem in an approximate way that has the order log(n) instead of O(n*n) as in a direct-sum simulation.

• Rainflow-counting algorithm : Reduces a complex stress history to a count of elementary stress-reversals for use in fatigue analysis

• Sweep and prune : a broad phase algorithm used during collision detection to limit the number of pairs of solids that need to be checked for collision

• VEGAS algorithm : a method for reducing error in Monte Carlo simulations

• Algorithms for calculating variance : avoiding instability and numerical overflow

• Approximate counting algorithm : Allows counting large number of events in a small register

• Nested sampling algorithm : a computational approach to the problem of comparing models in Bayesian statistics

• Average-linkage clustering : a simple agglomerative clustering algorithm

• Canopy clustering algorithm : an unsupervised pre-clustering algorithm related to the K-means algorithm

• Complete-linkage clustering : a simple agglomerative clustering algorithm

• DBSCAN : a density based clustering algorithm

• KHOPCA clustering algorithm : a local clustering algorithm, which produces hierarchical multi-hop clusters in static and mobile environments.

• k-means clustering : cluster objects based on attributes into partitions

• k-means++ : a variation of this, using modified random seeds

• k-medoids : similar to k-means, but chooses datapoints or medoids as centers

• Linde–Buzo–Gray algorithm : a vector quantization algorithm to derive a good codebook

• OPTICS : a density based clustering algorithm with a visual evaluation method

• Single-linkage clustering : a simple agglomerative clustering algorithm

• SUBCLU : a subspace clustering algorithm

• WACA clustering algorithm : a local clustering algorithm with potentially multi-hop structures; for dynamic networks

• Kalman filter : estimate the state of a linear dynamic system from a series of noisy measurements

• Baum–Welch algorithm : compute maximum likelihood estimates and posterior mode estimates for the parameters of a hidden markov model

• Viterbi algorithm : find the most likely sequence of hidden states in a hidden markov model

• Partial least squares regression : finds a linear model describing some predicted variables in terms of other observable variables

• Buzen's algorithm : an algorithm for calculating the normalization constant G(K) in the Gordon–Newell theorem

• Scoring algorithm : is a form of Newton's method used to solve maximum likelihood equations numerically

• Yamartino method : calculate an approximation to the standard deviation σθ of wind direction θ during a single pass through the incoming data

• Ziggurat algorithm : generate random numbers from a non-uniform distribution

• Tomasulo algorithm : allows sequential instructions that would normally be stalled due to certain dependencies to execute non-sequentially

• Marching cubes : extract a polygonal mesh of an isosurface from a three-dimensional scalar field (sometimes called voxels)

• Marching squares : generate contour lines for a two-dimensional scalar field

• Marching tetrahedrons : an alternative to Marching cubes

• Discrete Green's Theorem : is an algorithm for computing double integral over a generalized rectangular domain in constant time. It is a natural extension to the summed area table algorithm

• Flood fill : fills a connected region of a multi-dimensional array with a specified symbol

• Newell's algorithm : eliminate polygon cycles in the depth sorting required in hidden surface removal

• Painter's algorithm : detects visible parts of a 3-dimensional scenery

• Scanline rendering : constructs an image by moving an imaginary line over the image

• Bresenham's line algorithm : plots points of a 2-dimensional array to form a straight line between 2 specified points (uses decision variables)

• DDA line algorithm : plots points of a 2-dimensional array to form a straight line between 2 specified points (uses floating-point math)

• Xiaolin Wu's line algorithm : algorithm for line antialiasing.

• Midpoint circle algorithm : an algorithm used to determine the points needed for drawing a circle

• Ramer–Douglas–Peucker algorithm : Given a 'curve' composed of line segments to find a curve not too dissimilar but that has fewer points

• Gouraud shading : an algorithm to simulate the differing effects of light and colour across the surface of an object in 3D computer graphics

• Phong shading : an algorithm to interpolate surface normal-vectors for surface shading in 3D computer graphics

• HMAC : keyed-hash message authentication

• Quine–McCluskey algorithm : Also called as Q-M algorithm, programmable method for simplifying the boolean equations.

• Petrick's method : Another algorithm for boolean simplification.

• Espresso heuristic logic minimizer : Fast algorithm for boolean function minimization.

• ALOPEX : a correlation-based machine-learning algorithm

• AdaBoost : adaptive boosting BrownBoost a boosting algorithm that may be robust to noisy datasets

• LogitBoost : logistic regression boosting

• LPBoost : linear programming boosting

• C4.5 algorithm : an extension to ID3

• Linde–Buzo–Gray algorithm : a vector quantization algorithm used to derive a good codebook

• Backpropagation : A supervised learning method which requires a teacher that knows, or can calculate, the desired output for any given input

• Hopfield net : a Recurrent neural network in which all connections are symmetric

• Perceptron : the simplest kind of feedforward neural network: a linear classifier.

• Radial basis function network : an artificial neural network that uses radial basis functions as activation functions

• Self-organizing map : an unsupervised network that produces a low-dimensional representation of the input space of the training samples

• Random forest : classify using many decision trees

• Q-learning : learn an action-value function that gives the expected utility of taking a given action in a given state and following a fixed policy thereafter

• Structured SVM : allows training of a classifier for general structured output labels.

• Winnow algorithm : related to the perceptron, but uses a multiplicative weight-update scheme

• C3 linearization : an algorithm used primarily to obtain a consistent linearization of a multiple inheritance hierarchy in object-oriented programming

• Chaitin's algorithm : a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric

• Rete algorithm : an efficient pattern matching algorithm for implementing production rule systems

• Sethi-Ullman algorithm : generate optimal code for arithmetic expressions

• CYK algorithm : An O(n³) algorithm for parsing context-free grammars in Chomsky normal form

• Earley parser : Another O(n³) algorithm for parsing any context-free grammar

• GLR parser : An algorithm for parsing any context-free grammar by Masaru Tomita. It is tuned for deterministic grammars, on which it performs almost linear time and O(n³) in worst case.

• Inside-outside algorithm : An O(n³) algorithm for re-estimating production probabilities in probabilistic context-free grammars

• LL parser : A relatively simple linear time parsing algorithm for a limited class of context-free grammars

• Packrat parser : A linear time parsing algorithm supporting some context-free grammars and parsing expression grammars

• Recursive descent parser : A top-down parser suitable for LL(k) grammars

• Shunting yard algorithm : convert an infix-notation math expression to postfix

• Deutsch-Jozsa algorithm : criterion of balance for Boolean function

• Grover's algorithm : provides quadratic speedup for many search problems

• Shor's algorithm : provides exponential speedup (relative to currently known non-quantum algorithms) for factoring a number

• Simon's algorithm : provides a provably exponential speedup (relative to any non-quantum algorithm) for a black-box problem

• Hopcroft's algorithm, Moore's algorithm, and Brzozowski's algorithm : algorithms for minimizing the number of states in a deterministic finite automaton

• Powerset construction : Algorithm to convert nondeterministic automaton to deterministic automaton.

• Tarski–Kuratowski algorithm : a non-deterministic algorithm which provides an upper bound for the complexity of formulas in the arithmetical hierarchy and analytical hierarchy

• BCJR algorithm : decoding of error correcting codes defined on trellises (principally convolutional codes)

• Hamming(7,4) : a Hamming code that encodes 4 bits of data into 7 bits by adding 3 parity bits

• Hamming distance : sum number of positions which are different

• Luhn algorithm : a method of validating identification numbers

• Luhn mod N algorithm : extension of Luhn to non-numeric characters

• Parity : simple/fast error detection technique

• Burrows–Wheeler transform : preprocessing useful for improving lossless compression

• Delta encoding : aid to compression of data in which sequential data occurs frequently

• Dynamic Markov compression : Compression using predictive arithmetic coding

• LZWL : syllable-based variant

• Range encoding : same as arithmetic coding, but looked at in a slightly different way

• Adaptive Huffman coding : adaptive coding technique based on Huffman coding

• Package-merge algorithm : Optimizes Huffman coding subject to a length restriction on code strings

• Shannon–Fano–Elias coding : precursor to arithmetic encoding^[1]

• Golomb coding : form of entropy coding that is optimal for alphabets following geometric distributions

• Rice coding : form of entropy coding that is optimal for alphabets following geometric distributions

• Unary coding : code that represents a number n with n ones followed by a zero

• Incremental encoding : delta encoding applied to sequences of strings

• Run-length encoding : lossless data compression taking advantage of strings of repeated characters

• SEQUITUR algorithm : lossless compression by incremental grammar inference on a string

• 3Dc : a lossy data compression algorithm for normal maps

• A-law algorithm : standard companding algorithm

• Mu-law algorithm : standard analog signal compression or companding algorithm

• Fractal compression : method used to compress images using fractals

• Wavelet compression : form of data compression well suited for image compression (sometimes also video compression and audio compression)

• Transform coding : type of data compression for "natural" data like audio signals or photographic images

• Vector quantization : technique often used in lossy data compression

• Fast folding algorithm : an efficient algorithm for the detection of approximately periodic events within time series data

• Gerchberg–Saxton algorithm : Phase retrieval algorithm for optical planes

• Goertzel algorithm : identify a particular frequency component in a signal. Can be used for DTMF digit decoding.

• Karplus-Strong string synthesis : physical modelling synthesis to simulate the sound of a hammered or plucked string or some types of percussion

• Histogram equalization : use histogram to improve image contrast

• Adaptive histogram equalization : histogram equalization which adapts to local changes in contrast

• Connected-component labeling : find and label disjoint regions

• Canny edge detector : detect a wide range of edges in images

• Marr–Hildreth algorithm : an early edge detection algorithm

• SURF (Speeded Up Robust Features) : is a robust local feature detector, first presented by Herbert Bay et al. in 2006, that can be used in computer vision tasks like object recognition or 3D reconstruction. It is partly inspired by the SIFT descriptor. The standard version of SURF is several times faster than SIFT and claimed by its authors to be more robust against different image transformations than SIFT.

• Richardson–Lucy deconvolution : image de-blurring algorithm

• Blind deconvolution : image de-blurring algorithm when point spread function is unknown.

• Seam carving : content-aware image resizing algorithm

• GrowCut algorithm : an interactive segmentation algorithm

• Watershed transformation : a class of algorithms based on the watershed analogy

• CHS conversion : converting between disk addressing systems

• Double dabble : Convert binary numbers to BCD

• Fowler–Noll–Vo hash function : fast with low collision rate

• Pearson hashing : computes 8 bit value only, optimized for 8 bit computers

• Zobrist hashing : used in the implementation of transposition tables

• Xor swap algorithm : swaps the values of two variables without using a buffer

• Bully algorithm : a method for dynamically selecting a coordinator

• Byzantine fault tolerance : good fault tolerance.

• Lamport ordering : a partial ordering of events based on the happened-before relation

• Paxos algorithm : a family of protocols for solving consensus in a network of unreliable processors

• Vector clocks : generate a partial ordering of events in a distributed system and detect causality violations

• Buddy memory allocation : Algorithm to allocate memory such that fragmentation is less.

• Cheney's algorithm : An improvement on the Semi-space collector

• Generational garbage collector : Fast garbage collectors that segregate memory by age

• Mark-compact algorithm : a combination of the mark-sweep algorithm and Cheney's copying algorithm

• Semi-space collector : An early copying collector

• Karn's Algorithm : addresses the problem of getting accurate estimates of the round-trip time for messages when using TCP

• Luleå algorithm : a technique for storing and searching internet routing tables efficiently

• Nagle's algorithm : improve the efficiency of TCP/IP networks by coalescing packets

• Banker's algorithm : Algorithm used for deadlock avoidance.

• Adaptive replacement cache : better performance than LRU Top-nodes algorithm : resource calendar management

• Elevator algorithm : Disk scheduling algorithm that works like an elevator.

• Shortest seek first : Disk scheduling algorithm to reduce seek time.

• Fast Fourier Transform: A fast Fourier transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence

• Inverse Fast Fourier Transform: Inverse Fast Fourier transform (IFFT) algorithm computes the inverse discrete Fourier transform (Inverse DFT) of a sequence

Folder structure should be [Algorithm name]/[language]/file

For example:

• BubbleSort/Go/BubbleSort.go
• QuickSort/C++/QuickSort.cpp

License

Apache License 2.0