arith: Arithmetical algorithms like CORDIC and powering.
bits: Bit fiddling routines.
comb: Combinatorial objects like combinations, permutations, Gray codes, partitions and necklaces.
ds: Data structures like FIFO, heap and deque.
fft: Fast Fourier and Walsh transform.
gf2n: Binary polynomials, finite fields GF(2^n) and shift registers.
graph: Searching directed graphs, mostly to find combinatorial objects.
mod: Modular arithmetics and number theory.
perm: Routines for computations with permutations.
seq: Integer sequences by OEIS number, see http://oeis.org/.
sort: Sorting and searching: quick sort, radix sort and binary search.