Acid
47 lines
902 B
Markdown
47 lines
902 B
Markdown
# Data Structures & Algorithms in Go
|
|
|
|
## Linear
|
|
|
|
- [x] Stack
|
|
- [x] Queue
|
|
- [x] Double Linked List
|
|
- [x] Circular Buffer
|
|
- [ ] Deque (segmented array), ⛔ Not possible in Go
|
|
|
|
## Tree — hierarchical, parent/child relationships
|
|
|
|
- [ ] Binary Tree
|
|
- [ ] Binary Search Tree
|
|
- [ ] AVL Tree
|
|
- [ ] Heap (min/max)
|
|
- [ ] Trie
|
|
|
|
## Graph — nodes connected by edges, no strict hierarchy
|
|
|
|
- [ ] Directed
|
|
- [ ] Undirected
|
|
- [ ] Weighted
|
|
|
|
## Hash Based — key/value
|
|
|
|
- [ ] Hash Map
|
|
- [ ] Hash Set
|
|
|
|
# Algorithms ω
|
|
|
|
- [x] Kadane's Algorithm
|
|
|
|
# Each category solves different problems:
|
|
|
|
- Linear — ordered data, undo/redo, scheduling
|
|
- Tree — searching, sorting, hierarchical data like file systems
|
|
- Graph — networks, maps, social connections, dependencies
|
|
- Hash — fast lookups, caching, counting
|
|
- Set — membership testing, deduplication
|
|
|
|
# Documentation
|
|
|
|
```bash
|
|
go doc -all ./linear | bat -l go
|
|
```
|