README
¶
Back to School
Algorithms & data structures
Implementation of various algorithms and data structures, with the aim to learn Go.
References
- Algorithms & Data Structures, Jürg Nievergelt, Klaus H. Hinrichts, 1993 Prentice-Hall
- Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, 1997 MIT Press
- Algorithms and Data Structures, Niklaus Wirth 1985 (2004)
Useful Resources
- Big Oh Cheat Sheet
- Solutions to Introduction to Algorithms (Third Edition)
- Hacker Rank (YouTube)
- Algorithms (Khan Academy)
Go Specific Resources
Documentation
¶
There is no documentation for this package.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
apps
|
|
|
augmentedstruct/lrucache
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value);
|
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value); |
|
graph/wordladder
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time.
|
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time. |
|
bits
|
|
|
data
|
|
|
design
|
|
|
number
|
|
|
recursion
|
|
|
toh
Module
|
|
|
sort
|
|
|
radixsort
Radix Sort in Golang
|
Radix Sort in Golang |
|
struct
|
|
|
prioqueue
Package prioqueue provides a fixed-length priority queue using a heap.
|
Package prioqueue provides a fixed-length priority queue using a heap. |
|
tree/heap/binaryheap
Package heap provides a fixed-length binary heap.
|
Package heap provides a fixed-length binary heap. |
Click to show internal directories.
Click to hide internal directories.