Resources for particular algorithms that are often more difficult to cover

[Flaque]

In the algorithms section, we should have a small description and links to resources for things that are not commonly covered in a data structures class. (Or things that are fairly difficult)

For example:

• Trie data structure
• Breadth first and Depth first search
• A* and Dijkstras
• Dynamic programming / Memoization
• Greedy algorithms