Classic algorithms and data structures implemented in Go
Searching:
Shortest path:
Sorting:
- Binary GCD algorithm (wiki)
- Closest pairs (wiki)
- FastPower (wiki)
- Fibonacci (wiki)
- Fisher-Yates Shuffle (wiki)
- Erastothenes Sieve (wiki)
- Extented GCD algorithm (wiki)
- Karatsuba's Multiplication (wiki)
- Newton's Square Root (wiki)
- Permutations Count
- Strassen's matrix multiplication (wiki)
- Randomized Selection