Computer Science Algorithm Suggestions

[simon-tiger]

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
  • 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?
  • Even More? (Scroll down to see a GIANT table)
  • Traversal / Pathfinding / SSSP
  • Basic
    • Pre-order
    • In-order
    • Post-order
    • Depth-first
    • Breadth-first
    • More?
  • Shortest Pathfinding
    • Dijkstra's Shortest Path
    • A*
  • More?
  • Even More?
  • Substring Finding
  • Brute-force
  • DFA
  • KMP
  • More?
  • 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?
  • Min Vertex Cover
  • Brute-force
  • MVC
  • Approximation
  • Traveling Salesman
  • Brute-force
  • Dynamic Programming
  • Approximation
  • Steiner Tree

If you're brave, Do you want more even after all of this? One last note: you're not going to do all of them (probably!).

[b4ux1t3]

Spanning trees and hash tables get my vote. I think it'd be pretty easy to make them look cool.

[simon-tiger]

Well, we don't have to vote! We can do more than one, I just think it will be overwhelming to do all of them.

[simon-tiger]

Why I requested this even though The Coding Train has already done a series called Algorithms & Graphs: https://www.youtube.com/watch?v=hhvgeKw8y5Y

[b4ux1t3]

Dan could certainly do all of them, eventually. It's be worth exploring community interest balanced with prerequisites for a given algorithm.

Personally, I'd love to see Dan do a visualization of the spanning tree protocol in action on a network, since that's a nice real-world use case. But before we get there, we'd need to talk about graphs (which he has, I think) and all that stuff.

My comment here is more of an example than an actual suggestion, just how I think it would be best to approach a topic this deep.