Algorithms

Core

• Recursion
• Dynamic Programming
• Comparison Sorting
  • Merge Sort
  • Quicksort
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
• Searching
  • Linear Search
  • Binary Search
  • Breadth First Search (BFS)
  • Depth First Search (DFS)

Resources

• Visualizing Data Structures & Algorithms
• Unicode Characters | RapidTables
• The Big-O Algorithm Complexity Cheat Sheet

Dynamic Programming

• Closures | JavaScript

Recursion

• Recursion | Brilliant.org
• Tail Call Optimization in ES6

Searching

• Graph Traversals | VisuAlgo
• Tree Traversals: Preorder, Inorder, & Postorder
• Space Complexity: BFS vs DFS

Sorting

• Array.prototype.sort()
• Animated Sorting | Toptal
• Dancing Algorithms | AlgoRythmics
• QuickSort vs Heapsort
• Importance of Stability in Sorting

Most Common Sorts

• Merge Sort | Brilliant.org
• Quicksort | Brilliant.org
• Heap Sort | Brilliant.org
• Radix Sort | Brilliant.org
• Radix Sort Visualization
• Counting Sort | Brilliant.org
• Counting Sort Visualization