C++ implementations of miscellaneous algorithms
- Basic algorithms:
- Factorial (recursive)
- Greatest common divisor (GCD) with the Euclidean algorithm
- Power (recursive)
- Square root with the Babylonian method (a.k.a. the Heron's method)
- Fibonacci number
- Tower of Hanoi
- The knapsack problem
- N queens problem (backtracking approach)
- Spell checker based on the Noisy Channel Model and the Levenshtein distance
- k-nearest neighbors regressionn
Implementations are written based on C++11 standard.
All the algorithms are accompanied with unit tests