Album of Algorithms and Techniques
All pairs number A.I+A.J=X
APPROX_SUBSET_SUM - approximation algorithm,
subset-sum problem
ATRIAN - area of triangle (stable method)
B
BINARY_SEARCH - search
BITARRAY2D - bit array as decimal number
BOYER_MOORE_MATCHER - string-matching
C
CABS - complex modulus
CADD - complex addition
CDIV - complex division
CEILING - 
X
CMUL - complex multiplication
COMPLEX - creates a complex number
COS - cosine function
COUNTING_SORT - sorting
Creating a function returning constant
CSQRT - complex square root
CSUB - complex subtraction
D
DDPOLY - evaluation polynomial & its derivatives
DDPOLY1 - evaluation polynomial and its 1st
derivative
DECOMPRESS
DIOPHANT - diophantine linear equation
Determinant of a matrix
DPS - dynamic programming, subset-sum
problem
D2BITARRAY - decimal number as bit array
D2R - decimal to roman
E
E - Euler's number e
ECONST - first 200 digits of e
Euler's constant gamma
EXACT_SUBSET_SUM - exact algorithm,
subset-sum problem
EXEUCLID - extended form of Euclid's algorithm
EXP - exponential function
GENERAL_FIB - general formula for Fibonacci
numbers
F
FACT - factorial
FADD - addition fractions
FCOMP - comparison fractions
FDIV - division fractions
FIB - Fibonacci numbers
FIND - selecting the Kth smallest
FLOOR - 
X
FMUL - multiplication fractions
G
GAMMA_CONST - first 60 digits of gamma
GCD - Euclid's GCD algorithm
GENSUB - generation of all subsets with K
elements
Gray code
GS - greedy algorithm, subset-sum problem
H
HEAPSORT - sorting
HEAPSORT_RADIX3 - sorting
HERON - area of triangle (unstable method)
HORNER - evaluating polynomials
I
IMAGINARY - imaginary part of complex number
INTERPOLATION_SEARCH - search
Inverse of a matrix
J
K
KMP_MATCHER - string-matching
L
LCG - linear congruential generator
LCM - least common multiple
LN - natural logarithm
LN2 - first 200 digits of LN(2)
LN2P - LN(2)
LN10 - first 200 digits of LN(10)
LOCATE - search an array of abscissas
LUBKSB - routine for solution of linear
algebraic equations
LUDCMP - LU decomposition
