Computer Science Algorithm Suggestions

Because I like computer science these days, here are some computer science algorithm suggestions:

- Data Structures
- Array
- Linked List
- Hash Table
- Stack
- Queue
- Priority Queue (Binary heap)
- Suffix Array
- Graph Theory
- Graph (general)
- Tree
- Binary Tree
- Full vs. Complete
- BST
- Binary Heap
- AVL Tree
- Red-Black Tree
- Segment Tree
- DFA
- Biparite
- UFDS
- Fenwick Tree
- Min Spanning Tree
- Suffix Tree
- [Computational Geometry](https://en.wikipedia.org/wiki/Computational_geometry)
- Polygon, etc.
- Algorithms
- Searching
- Linear Search
- Binary Search
- Shuffling
- Fisher-Yates Algorithm
- Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quicksort
- Counting Sort
- Radix Sort
- [More?](http://www.zaxrosenberg.com/must-know-sorting-algorithms-in-python/)
- [Even More?](https://en.wikipedia.org/wiki/Sorting_algorithm) (Scroll down to see a GIANT table)
- Traversal / Pathfinding / SSSP
- Basic
- Pre-order
- In-order
- Post-order
- Depth-first
- Breadth-first
- [More?](https://visualgo.net/en/dfsbfs)
- Shortest Pathfinding
- Dijkstra's Shortest Path
- A*
- [More?](https://visualgo.net/en/sssp)
- [Even More?](https://qiao.github.io/PathFinding.js/visual/)
- Substring Finding
- Brute-force
- DFA
- KMP
- [More?](https://en.wikipedia.org/wiki/String-searching_algorithm)
- Min Spanning Tree
- Brute-force
- Kruskal's Algorithm
- Prim's Algorithm(s)
- Max-flow
- Graph Matching
- Cycle Finding
- Convex Hull
- Gift Wrapping
- Graham Scan
- Quickhull
- "The Ultimate Planar Convex Hull Algorithm"
- [More?](https://en.wikipedia.org/wiki/Convex_hull_algorithms)
- Min Vertex Cover
- Brute-force
- MVC
- Approximation
- Traveling Salesman
- Brute-force
- Dynamic Programming
- Approximation
- [Steiner Tree](https://visualgo.net/en/steinertree)

If you're brave, [Do you want more even after *all of this*?](https://visualgo.net/en/)
One last note: **you're not going to do all of them (probably!)**.