A place to store algorithms written during study sessions. Mostly based on the book Grokking Algorithms
bin search = O(log2 n)
slecteon sort = O(n^2)
simple search = O(n)
quicksort = O(n log2 n)
selection sort = O(n2)
Traveling Salesman = O(n!)
Breadth-first = O(V + E)