README
¶
Algo ⚡
Common algorithms, generic collections and data structures in Go.
- 💡 Generic Set
- 📃 List
- 🛠️ Stack
- 📦 Trie
- 🚇 Queue
- 📔 HashMap
- 🌴 Binary Tree
Writing applications in Go requires you to write repetitive code for manipulating slices, maps and arrays. Having generic well tested algorithms simplifies code, iteration, and is a good start to learning about the common algorithms and their implementation.
All packages are tested. That's the documentation for now. 🤣
License
MIT
Documentation
¶
There is no documentation for this package.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
implentation of a safe concurrent generic map
|
implentation of a safe concurrent generic map |
|
stack implementation using a slice.
|
stack implementation using a slice. |
|
Effecient Trie data structure implementation using a map.
|
Effecient Trie data structure implementation using a map. |
Click to show internal directories.
Click to hide internal directories.