- Wavelet Tree: a succinct data structure to store strings in compressed space
- Binary Heap: a binary tree with heap property
- Levenshtein Distance: a distance on strings (a.k.a edit distance)
- Pattern Matching: comparison of Knuth-Morris-Pratt and Boyer-Moore algorithms
- Lsystem: a type of grammet Lindenmayer system
- Dijkstra: find a shortest path between any two points on a graph
- Bayes Filter: a text classifier with naive Bayes
- Logistic Regression: implementations of online(batch) logistic regression
- Density Estimation: estimate a probability distributoin with Dirichlet dist. as its conjugate prior dist.
- EM(Expectation-Maximization) algorith:
- K-Means: a basic clustring algorithm
- Depth-first search: given a set of paragraphs, N and k, find top-k N-grams with DFS
- Memorized Recursive: an implementation of Depth-first seach with memorization
- Enumeration algorithms: numerate words that contains the specified number of significant bits
- Extended Stack & Queue: an implementation of Stack(and Queue) that finds the minimum value at O(1)
- Genetic Algorithms: an implementation of GA