docs: add algos README

Author: jessicayung

algorithms/README.md

@@ -0,0 +1,32 @@
+# Algorithms
+
+Algorithms implemented:
+- Breadth-first search
+- Flood fill (DFS version)
+- Finding articulation points (brute force only)
+- Dynamic programming (as ipynb)
+
+Data structures and environments implemented:
+- Graphs
+- 2D grid
+
+TODO:
+- DFS standalone
+- BFS and DFS as part of the Graph class
+- Shortest path
+- Greedy
+- Dynamic programming as a .py file
+- Knapsack
+- Computational geometry
+- Network flow
+- Eulerian Path
+- Two-dimensional convex hull
+- BigNums
+- Finding articulation points (uses backedges or bridges)
+- Minimum Spanning Tree (MST)
+- Sorts
+- Searches
+    - Complete Search
+    - Heuristic search
+    - Approximate search
+- Other graph algorithms (Hamiltonian Path, Maximum Flow, min cost max flow, topological sort)