Learning Go by implementing different Data Structures and Algorithms. Using Algorithms 4th ed, by Sedgewick as a reference material.
- Elementary Sorts
- Mergesort
- Quicksort
- Priority Queues
- Symbol Tables
- Binary Search Trees
- Balanced Search Trees
- Hash Tables
- Undirected Graphs
- Directed Graphs
- Minimum Spanning Trees
- Shortest Paths
- String Sorts
- Tries
- Substring Search
- Regular Expressions
- Data Compression