Algorithms Algorithms Collection Simple Search – O(n) Linear time Binary Search – O(log n) Log time Quicksort – O(n * log n) Selection sort – O(n2) The traveling salesperson – O(n!) Breadth-first Search (Graph) Dijkstra’s algorithm (Graph) Concepts Big O Notation O(1) Hash Tables O(n) Linear time: Simple Search O(log n) Log time: Binary Search O(n * log n) Quicksort: A fast sorting algorithm O(n2) Selection sort: A slow sorting algorithm O(n!) The traveling salesperson Other Concepts Running time Recursion Base case and Recursive case Call stack Divide & conquer FIFO & LIFO Resources Book: Grokking Algorithms Big O Notation Video Article: Asymptotic Analysis Explained with Pokémon: A Deep Dive into Complexity Analysis Codecademy: Big O Khan Academy: Data Structures Udacity: Intro to Algorithms Udacity: Programming Languages