My algorithms collections
- Sorts
- Dynamic Programming
- Binary Search
- Greedy
- Graph
- Backtracking
- LRU
- Scheduling
- Floyd's (Tortoise & Hare)
- Stack algorithm: the set of pages in memory for
n
frames is always a subset of the set of pages that would be in memory withn + 1
frames
flowchart LR
subgraph n1f["n + 1 frame"]
subgraph nf["n frame"]
p["the set of pages"]
end
end