~*~ MEET THE PROFESSOR ~*~

wow much merge sort so O(1) such O(log n) very linked list much recursion so heap many pointers such stack overflow very hash map much binary tree so amortized many edge cases such Dijkstra very Big-O bubble sort